./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:11:18,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:11:19,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:11:19,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:11:19,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:11:19,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:11:19,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:11:19,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:11:19,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:11:19,052 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:11:19,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:11:19,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:11:19,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:11:19,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:11:19,055 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:11:19,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:11:19,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:11:19,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:11:19,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:11:19,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:11:19,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:11:19,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:11:19,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:11:19,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:11:19,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:11:19,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:11:19,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:11:19,062 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:11:19,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:11:19,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:11:19,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:11:19,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:11:19,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:19,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:11:19,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:11:19,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:11:19,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:11:19,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:11:19,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:11:19,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:11:19,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:11:19,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:11:19,067 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee [2024-11-08 23:11:19,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:11:19,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:11:19,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:11:19,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:11:19,352 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:11:19,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-11-08 23:11:20,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:11:20,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:11:20,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-11-08 23:11:20,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbe00ef4/ced22a93bb3a4f24b764ce38005c1e38/FLAG7992a5650 [2024-11-08 23:11:21,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbe00ef4/ced22a93bb3a4f24b764ce38005c1e38 [2024-11-08 23:11:21,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:11:21,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:11:21,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:21,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:11:21,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:11:21,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebdfd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21, skipping insertion in model container [2024-11-08 23:11:21,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:11:21,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-11-08 23:11:21,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:21,599 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:11:21,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-11-08 23:11:21,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:21,644 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:11:21,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21 WrapperNode [2024-11-08 23:11:21,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:21,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:21,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:11:21,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:11:21,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,683 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-08 23:11:21,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:21,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:11:21,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:11:21,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:11:21,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,710 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:11:21,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:11:21,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:11:21,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:11:21,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:11:21,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (1/1) ... [2024-11-08 23:11:21,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:21,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:11:21,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:11:21,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:11:21,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:11:21,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:11:21,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:11:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:11:21,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:11:21,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:11:21,904 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:11:21,908 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:11:22,174 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 23:11:22,174 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:11:22,191 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:11:22,191 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:11:22,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:22 BoogieIcfgContainer [2024-11-08 23:11:22,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:11:22,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:11:22,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:11:22,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:11:22,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:11:21" (1/3) ... [2024-11-08 23:11:22,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b16ae4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:22, skipping insertion in model container [2024-11-08 23:11:22,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:21" (2/3) ... [2024-11-08 23:11:22,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b16ae4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:22, skipping insertion in model container [2024-11-08 23:11:22,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:22" (3/3) ... [2024-11-08 23:11:22,203 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-60.i [2024-11-08 23:11:22,225 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:11:22,225 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:11:22,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:11:22,299 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@11216c59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:11:22,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:11:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:11:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 23:11:22,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:22,321 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:11:22,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:22,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1256823009, now seen corresponding path program 1 times [2024-11-08 23:11:22,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:22,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294947162] [2024-11-08 23:11:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:22,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:11:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:11:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:11:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:11:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:11:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:11:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:11:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:11:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:11:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:11:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:11:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:11:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:11:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:11:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:11:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:11:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:11:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:11:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:11:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:11:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:11:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:11:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 23:11:22,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:11:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294947162] [2024-11-08 23:11:22,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294947162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:22,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:22,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:11:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564812658] [2024-11-08 23:11:22,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:22,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:11:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:11:22,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:11:22,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:11:22,878 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 23:11:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:22,909 INFO L93 Difference]: Finished difference Result 115 states and 200 transitions. [2024-11-08 23:11:22,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:11:22,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2024-11-08 23:11:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:22,922 INFO L225 Difference]: With dead ends: 115 [2024-11-08 23:11:22,923 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 23:11:22,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:11:22,931 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:22,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:11:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 23:11:22,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-08 23:11:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:11:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2024-11-08 23:11:22,972 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 135 [2024-11-08 23:11:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:22,972 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2024-11-08 23:11:22,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 23:11:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2024-11-08 23:11:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 23:11:22,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:22,976 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:11:22,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:11:22,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:22,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash -938106785, now seen corresponding path program 1 times [2024-11-08 23:11:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:22,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069172168] [2024-11-08 23:11:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:11:23,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:11:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:11:23,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:11:23,289 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:11:23,291 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:11:23,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:11:23,300 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 23:11:23,400 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:11:23,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:11:23 BoogieIcfgContainer [2024-11-08 23:11:23,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:11:23,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:11:23,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:11:23,408 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:11:23,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:22" (3/4) ... [2024-11-08 23:11:23,411 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:11:23,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:11:23,413 INFO L158 Benchmark]: Toolchain (without parser) took 2064.32ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 76.5MB in the end (delta: 36.3MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-11-08 23:11:23,413 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:11:23,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.38ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 98.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:11:23,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.78ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:11:23,414 INFO L158 Benchmark]: Boogie Preprocessor took 41.25ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 93.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:11:23,415 INFO L158 Benchmark]: RCFGBuilder took 465.94ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 77.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:11:23,416 INFO L158 Benchmark]: TraceAbstraction took 1212.75ms. Allocated memory is still 167.8MB. Free memory was 76.7MB in the beginning and 76.5MB in the end (delta: 207.4kB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2024-11-08 23:11:23,416 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 167.8MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:11:23,419 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.38ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 98.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.78ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.25ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 93.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.94ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 77.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1212.75ms. Allocated memory is still 167.8MB. Free memory was 76.7MB in the beginning and 76.5MB in the end (delta: 207.4kB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 167.8MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 9999; [L23] signed long int var_1_2 = 64; [L24] signed long int var_1_3 = 31; [L25] signed long int var_1_4 = 1; [L26] unsigned char var_1_5 = 2; [L27] signed long int var_1_6 = 10; [L28] signed long int var_1_7 = 5; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 1; [L31] signed long int var_1_10 = 64; [L32] signed long int var_1_11 = 32; [L33] signed long int var_1_12 = 10; [L34] signed long int var_1_13 = 4; [L35] signed long int var_1_14 = 999; [L36] signed long int var_1_15 = 2; [L37] signed long int var_1_16 = 8; [L38] signed long int last_1_var_1_16 = 8; VAL [isInitial=0, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=64, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=64, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L70] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L71] var_1_3 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L73] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 255) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L77] var_1_6 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L80] var_1_8 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_9=1] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L83] var_1_9 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1] [L84] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1] [L85] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L85] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L86] var_1_10 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L87] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L88] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L88] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L89] var_1_11 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L91] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L91] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L92] var_1_12 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L93] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L94] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L94] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L95] var_1_13 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L96] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L97] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L97] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L98] var_1_14 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L99] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L100] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L100] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L114] RET updateVariables() [L115] CALL step() [L42] var_1_1 = (var_1_2 - var_1_3) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=2, var_1_16=8, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L43] COND FALSE !((- var_1_5) >= var_1_6) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=2, var_1_16=8, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L52] unsigned char stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_16=8, stepLocal_0=-255, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=2, var_1_16=8, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L53] COND TRUE var_1_8 && stepLocal_0 [L54] var_1_7 = ((var_1_10 - var_1_11) + (var_1_12 + (var_1_13 + var_1_14))) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=2, var_1_16=8, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L56] var_1_15 = 500.25 VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_16=8, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L57] COND FALSE !(var_1_2 > last_1_var_1_16) [L64] var_1_16 = var_1_12 VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_16=0, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((var_1_1 == ((signed long int) (var_1_2 - var_1_3))) && (((- var_1_5) >= var_1_6) ? ((var_1_6 > var_1_5) ? ((var_1_3 == var_1_1) ? (var_1_4 == ((signed long int) (256 - (var_1_5 + 5)))) : (var_1_4 == ((signed long int) var_1_5))) : 1) : 1)) && ((var_1_8 && var_1_9) ? (var_1_7 == ((signed long int) ((var_1_10 - var_1_11) + (var_1_12 + (var_1_13 + var_1_14))))) : 1)) && (var_1_15 == ((signed long int) 500.25))) && ((var_1_2 > last_1_var_1_16) ? (var_1_9 ? ((var_1_3 <= ((((last_1_var_1_16) < (var_1_11)) ? (last_1_var_1_16) : (var_1_11)))) ? (var_1_16 == ((signed long int) (var_1_14 + var_1_11))) : 1) : 1) : (var_1_16 == ((signed long int) var_1_12))) ; VAL [\result=0, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=10000, var_1_16=0, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=10000, var_1_16=0, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=8, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=10000, var_1_16=0, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 85 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 924/924 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:11:23,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:11:25,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:11:25,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:11:25,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:11:25,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:11:25,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:11:25,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:11:25,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:11:25,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:11:25,776 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:11:25,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:11:25,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:11:25,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:11:25,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:11:25,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:11:25,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:11:25,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:11:25,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:11:25,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:11:25,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:11:25,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:11:25,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:11:25,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:11:25,784 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:11:25,785 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:11:25,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:11:25,785 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:11:25,785 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:11:25,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:11:25,786 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:11:25,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:11:25,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:11:25,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:11:25,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:11:25,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:25,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:11:25,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:11:25,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:11:25,790 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:11:25,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:11:25,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:11:25,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:11:25,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:11:25,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:11:25,792 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee [2024-11-08 23:11:26,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:11:26,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:11:26,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:11:26,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:11:26,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:11:26,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-11-08 23:11:27,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:11:27,895 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:11:27,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-11-08 23:11:27,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eab7af427/f39b8ec78b3647958e3ba08d6a5f37d8/FLAGd770626e3 [2024-11-08 23:11:27,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eab7af427/f39b8ec78b3647958e3ba08d6a5f37d8 [2024-11-08 23:11:27,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:11:27,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:11:27,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:27,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:11:27,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:11:27,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:27" (1/1) ... [2024-11-08 23:11:27,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a0807f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:27, skipping insertion in model container [2024-11-08 23:11:27,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:27" (1/1) ... [2024-11-08 23:11:27,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:11:28,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-11-08 23:11:28,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:28,184 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:11:28,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-11-08 23:11:28,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:28,235 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:11:28,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28 WrapperNode [2024-11-08 23:11:28,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:28,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:28,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:11:28,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:11:28,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,283 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-08 23:11:28,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:28,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:11:28,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:11:28,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:11:28,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,318 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:11:28,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:11:28,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:11:28,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:11:28,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:11:28,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (1/1) ... [2024-11-08 23:11:28,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:28,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:11:28,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:11:28,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:11:28,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:11:28,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:11:28,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:11:28,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:11:28,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:11:28,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:11:28,501 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:11:28,504 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:11:28,784 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 23:11:28,784 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:11:28,797 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:11:28,798 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:11:28,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:28 BoogieIcfgContainer [2024-11-08 23:11:28,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:11:28,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:11:28,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:11:28,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:11:28,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:11:27" (1/3) ... [2024-11-08 23:11:28,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b32f52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:28, skipping insertion in model container [2024-11-08 23:11:28,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:28" (2/3) ... [2024-11-08 23:11:28,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b32f52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:28, skipping insertion in model container [2024-11-08 23:11:28,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:28" (3/3) ... [2024-11-08 23:11:28,808 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-60.i [2024-11-08 23:11:28,824 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:11:28,824 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:11:28,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:11:28,909 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@19b8a0f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:11:28,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:11:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:11:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 23:11:28,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:28,933 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:11:28,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:28,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1256823009, now seen corresponding path program 1 times [2024-11-08 23:11:28,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:11:28,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860007865] [2024-11-08 23:11:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:28,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:11:28,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:11:28,958 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:11:28,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:11:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:29,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:11:29,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:11:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-08 23:11:29,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:11:29,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:11:29,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860007865] [2024-11-08 23:11:29,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860007865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:29,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:29,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:11:29,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583977619] [2024-11-08 23:11:29,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:29,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:11:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:11:29,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:11:29,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:11:29,230 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 23:11:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:29,261 INFO L93 Difference]: Finished difference Result 115 states and 200 transitions. [2024-11-08 23:11:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:11:29,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2024-11-08 23:11:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:29,271 INFO L225 Difference]: With dead ends: 115 [2024-11-08 23:11:29,271 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 23:11:29,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:11:29,278 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:29,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:11:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 23:11:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-08 23:11:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:11:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2024-11-08 23:11:29,318 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 135 [2024-11-08 23:11:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:29,319 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2024-11-08 23:11:29,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 23:11:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2024-11-08 23:11:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 23:11:29,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:29,324 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:11:29,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:11:29,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:11:29,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:29,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:29,526 INFO L85 PathProgramCache]: Analyzing trace with hash -938106785, now seen corresponding path program 1 times [2024-11-08 23:11:29,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:11:29,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827355038] [2024-11-08 23:11:29,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:29,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:11:29,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:11:29,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:11:29,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:11:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:29,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 23:11:29,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:11:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 23:11:45,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:11:45,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:11:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827355038] [2024-11-08 23:11:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827355038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:45,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:11:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211289141] [2024-11-08 23:11:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:45,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:11:45,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:11:45,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:11:45,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:11:45,131 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 23:11:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:45,900 INFO L93 Difference]: Finished difference Result 92 states and 127 transitions. [2024-11-08 23:11:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:11:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2024-11-08 23:11:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:45,904 INFO L225 Difference]: With dead ends: 92 [2024-11-08 23:11:45,904 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 23:11:45,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:11:45,906 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 75 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:45,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 397 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:11:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 23:11:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2024-11-08 23:11:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 23:11:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2024-11-08 23:11:45,926 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 135 [2024-11-08 23:11:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:45,928 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2024-11-08 23:11:45,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 23:11:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2024-11-08 23:11:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 23:11:45,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:45,932 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:11:45,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:11:46,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:11:46,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:46,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:46,136 INFO L85 PathProgramCache]: Analyzing trace with hash 836900577, now seen corresponding path program 1 times [2024-11-08 23:11:46,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:11:46,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554117656] [2024-11-08 23:11:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:46,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:11:46,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:11:46,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:11:46,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:11:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:46,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 23:11:46,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:12:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 483 proven. 30 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-11-08 23:12:12,832 INFO L311 TraceCheckSpWp]: Computing backward predicates...