./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-63.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 4464cb734770b9d0fa9d6e2642392f2055c585b5ff2c6b71c083265ca3731e1b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:20:56,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:20:56,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:20:56,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:20:56,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:20:56,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:20:56,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:20:56,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:20:56,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:20:56,341 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:20:56,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:20:56,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:20:56,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:20:56,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:20:56,345 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:20:56,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:20:56,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:20:56,345 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:20:56,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:20:56,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:20:56,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:20:56,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:20:56,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:20:56,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:20:56,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:20:56,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:20:56,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:20:56,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:20:56,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:20:56,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:20:56,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:20:56,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:20:56,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:20:56,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:20:56,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:20:56,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:20:56,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:20:56,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:20:56,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:20:56,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:20:56,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:20:56,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:20:56,352 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 -> 4464cb734770b9d0fa9d6e2642392f2055c585b5ff2c6b71c083265ca3731e1b [2024-10-13 04:20:56,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:20:56,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:20:56,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:20:56,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:20:56,573 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:20:56,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-63.i [2024-10-13 04:20:57,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:20:57,983 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:20:57,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-63.i [2024-10-13 04:20:57,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f9098316/b7cb518301404aee885b85d5d6f552a2/FLAGffe30b76a [2024-10-13 04:20:58,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f9098316/b7cb518301404aee885b85d5d6f552a2 [2024-10-13 04:20:58,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:20:58,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:20:58,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:20:58,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:20:58,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:20:58,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738ce396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58, skipping insertion in model container [2024-10-13 04:20:58,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:20:58,557 WARN L248 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_loopvsstraightlinecode_25-while_file-63.i[915,928] [2024-10-13 04:20:58,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:20:58,594 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:20:58,603 WARN L248 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_loopvsstraightlinecode_25-while_file-63.i[915,928] [2024-10-13 04:20:58,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:20:58,628 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:20:58,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58 WrapperNode [2024-10-13 04:20:58,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:20:58,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:20:58,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:20:58,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:20:58,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,667 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-13 04:20:58,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:20:58,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:20:58,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:20:58,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:20:58,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,693 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-10-13 04:20:58,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:20:58,707 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:20:58,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:20:58,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:20:58,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (1/1) ... [2024-10-13 04:20:58,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:20:58,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:20:58,742 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-10-13 04:20:58,744 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-10-13 04:20:58,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:20:58,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:20:58,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:20:58,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:20:58,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:20:58,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:20:58,885 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:20:58,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:20:59,076 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 04:20:59,076 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:20:59,120 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:20:59,120 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:20:59,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:59 BoogieIcfgContainer [2024-10-13 04:20:59,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:20:59,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:20:59,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:20:59,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:20:59,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:20:58" (1/3) ... [2024-10-13 04:20:59,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c9cd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:20:59, skipping insertion in model container [2024-10-13 04:20:59,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:58" (2/3) ... [2024-10-13 04:20:59,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c9cd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:20:59, skipping insertion in model container [2024-10-13 04:20:59,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:59" (3/3) ... [2024-10-13 04:20:59,127 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-63.i [2024-10-13 04:20:59,139 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:20:59,140 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:20:59,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:20:59,199 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;@11128894, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:20:59,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:20:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:20:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 04:20:59,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:59,213 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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-10-13 04:20:59,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:59,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1672544830, now seen corresponding path program 1 times [2024-10-13 04:20:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:20:59,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118287041] [2024-10-13 04:20:59,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:59,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:20:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:20:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:20:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:20:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 04:20:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:20:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:20:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:20:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:20:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 04:20:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:20:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 04:20:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:20:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:20:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:20:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:20:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:20:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:20:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:20:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:20:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:20:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 04:20:59,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:20:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118287041] [2024-10-13 04:20:59,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118287041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:20:59,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:20:59,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:20:59,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662411758] [2024-10-13 04:20:59,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:20:59,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:20:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:20:59,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:20:59,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:20:59,542 INFO L87 Difference]: Start difference. First operand has 49 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 04:20:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:20:59,573 INFO L93 Difference]: Finished difference Result 95 states and 170 transitions. [2024-10-13 04:20:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:20:59,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 119 [2024-10-13 04:20:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:20:59,590 INFO L225 Difference]: With dead ends: 95 [2024-10-13 04:20:59,590 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 04:20:59,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-10-13 04:20:59,598 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:20:59,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:20:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 04:20:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-13 04:20:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:20:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2024-10-13 04:20:59,664 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 119 [2024-10-13 04:20:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:20:59,667 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2024-10-13 04:20:59,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 04:20:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2024-10-13 04:20:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 04:20:59,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:59,670 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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-10-13 04:20:59,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:20:59,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:59,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1211145342, now seen corresponding path program 1 times [2024-10-13 04:20:59,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:20:59,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761939172] [2024-10-13 04:20:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:20:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:20:59,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:20:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:20:59,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:20:59,864 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:20:59,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:20:59,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:20:59,870 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 04:20:59,943 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:20:59,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:20:59 BoogieIcfgContainer [2024-10-13 04:20:59,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:20:59,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:20:59,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:20:59,947 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:20:59,948 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:59" (3/4) ... [2024-10-13 04:20:59,949 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:20:59,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:20:59,954 INFO L158 Benchmark]: Toolchain (without parser) took 1555.88ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 83.0MB in the beginning and 162.6MB in the end (delta: -79.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:20:59,955 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:20:59,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.84ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 68.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:20:59,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.74ms. Allocated memory is still 155.2MB. Free memory was 68.9MB in the beginning and 66.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:20:59,956 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 155.2MB. Free memory was 66.5MB in the beginning and 63.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:20:59,956 INFO L158 Benchmark]: RCFGBuilder took 412.99ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 63.7MB in the beginning and 180.1MB in the end (delta: -116.4MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-10-13 04:20:59,956 INFO L158 Benchmark]: TraceAbstraction took 823.60ms. Allocated memory is still 222.3MB. Free memory was 179.1MB in the beginning and 162.6MB in the end (delta: 16.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-13 04:20:59,956 INFO L158 Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 222.3MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:20:59,959 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.14ms. Allocated memory is still 155.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.84ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 68.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.74ms. Allocated memory is still 155.2MB. Free memory was 68.9MB in the beginning and 66.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 155.2MB. Free memory was 66.5MB in the beginning and 63.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.99ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 63.7MB in the beginning and 180.1MB in the end (delta: -116.4MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * TraceAbstraction took 823.60ms. Allocated memory is still 222.3MB. Free memory was 179.1MB in the beginning and 162.6MB in the end (delta: 16.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 4.71ms. Allocated memory is still 222.3MB. Free memory is still 162.6MB. 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 someBinaryFLOATComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 8.3; [L24] float var_1_3 = 2.25; [L25] float var_1_4 = 10.3; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] signed long int var_1_7 = 128; [L29] float var_1_8 = 9.8; [L30] signed long int var_1_9 = -256; [L31] unsigned short int var_1_10 = 5; [L32] signed char var_1_11 = 8; [L33] signed long int var_1_12 = 2; [L34] unsigned short int var_1_13 = 32; [L35] unsigned short int var_1_14 = 1; [L36] unsigned short int last_1_var_1_10 = 5; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_10 = var_1_10 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L62] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_3=9/4, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L64] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_4=103/10, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L65] var_1_4 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L66] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L67] var_1_5 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L68] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L69] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L69] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L70] var_1_6 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L71] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L72] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L72] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_8=49/5, var_1_9=-256] [L73] var_1_8 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-256] [L74] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-256] [L75] var_1_9 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_9 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L76] RET assume_abort_if_not(var_1_9 >= -2147483647) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L77] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=8, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L78] var_1_11 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_11 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L79] RET assume_abort_if_not(var_1_11 >= -128) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L80] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L80] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L81] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L81] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L82] var_1_12 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L83] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L85] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L85] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=32, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L86] var_1_13 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L88] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L88] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=1, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L89] var_1_14 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L91] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L91] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=128, var_1_9=-2147483647] [L105] RET updateVariables() [L106] CALL step() [L40] COND TRUE var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8) [L41] var_1_7 = ((((-200) > (last_1_var_1_10)) ? (-200) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L45] COND FALSE !(var_1_8 > var_1_4) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L56] COND TRUE ((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4) [L57] var_1_1 = (var_1_5 && var_1_6) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L106] RET step() [L107] CALL, EXPR property() [L97-L98] return (((((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : 1) && ((var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8)) ? (var_1_7 == ((signed long int) ((((-200) > (last_1_var_1_10)) ? (-200) : (last_1_var_1_10))))) : (var_1_7 == ((signed long int) last_1_var_1_10)))) && ((var_1_8 > var_1_4) ? ((! var_1_6) ? (((var_1_9 / ((((var_1_11) > (-64)) ? (var_1_11) : (-64)))) < (var_1_7 / var_1_12)) ? (var_1_10 == ((unsigned short int) var_1_13)) : (var_1_10 == ((unsigned short int) var_1_13))) : (var_1_10 == ((unsigned short int) var_1_14))) : 1) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=-2147483647] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=5, var_1_10=5, var_1_11=1, var_1_12=1, var_1_13=65534, var_1_14=65534, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_9=-2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 20, 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, 68 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 68 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 760/760 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-10-13 04:20:59,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-63.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 4464cb734770b9d0fa9d6e2642392f2055c585b5ff2c6b71c083265ca3731e1b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:21:01,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:21:01,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:21:01,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:21:01,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:21:01,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:21:01,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:21:01,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:21:01,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:21:01,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:21:01,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:21:01,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:21:01,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:21:01,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:21:01,976 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:21:01,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:21:01,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:21:01,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:21:01,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:21:01,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:21:01,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:21:01,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:21:01,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:21:01,981 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:21:01,981 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:21:01,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:21:01,981 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:21:01,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:21:01,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:21:01,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:21:01,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:21:01,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:21:01,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:21:01,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:21:01,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:21:01,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:21:01,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:21:01,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:21:01,983 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:21:01,983 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:21:01,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:21:01,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:21:01,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:21:01,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:21:01,986 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:21:01,986 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 -> 4464cb734770b9d0fa9d6e2642392f2055c585b5ff2c6b71c083265ca3731e1b [2024-10-13 04:21:02,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:21:02,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:21:02,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:21:02,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:21:02,260 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:21:02,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-63.i [2024-10-13 04:21:03,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:21:03,703 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:21:03,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-63.i [2024-10-13 04:21:03,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8ff422d/19f4a77335ca4964960faa98380f35ee/FLAG2b2e6d5ac [2024-10-13 04:21:03,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8ff422d/19f4a77335ca4964960faa98380f35ee [2024-10-13 04:21:03,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:21:03,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:21:03,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:21:03,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:21:03,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:21:03,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:21:03" (1/1) ... [2024-10-13 04:21:03,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@666997fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:03, skipping insertion in model container [2024-10-13 04:21:03,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:21:03" (1/1) ... [2024-10-13 04:21:03,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:21:03,941 WARN L248 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_loopvsstraightlinecode_25-while_file-63.i[915,928] [2024-10-13 04:21:03,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:21:04,007 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:21:04,017 WARN L248 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_loopvsstraightlinecode_25-while_file-63.i[915,928] [2024-10-13 04:21:04,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:21:04,064 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:21:04,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04 WrapperNode [2024-10-13 04:21:04,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:21:04,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:21:04,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:21:04,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:21:04,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,114 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-13 04:21:04,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:21:04,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:21:04,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:21:04,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:21:04,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,144 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-10-13 04:21:04,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:21:04,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:21:04,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:21:04,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:21:04,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (1/1) ... [2024-10-13 04:21:04,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:21:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:21:04,202 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-10-13 04:21:04,205 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-10-13 04:21:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:21:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:21:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:21:04,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:21:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:21:04,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:21:04,312 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:21:04,314 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:21:06,479 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 04:21:06,479 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:21:06,527 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:21:06,527 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:21:06,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:21:06 BoogieIcfgContainer [2024-10-13 04:21:06,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:21:06,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:21:06,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:21:06,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:21:06,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:21:03" (1/3) ... [2024-10-13 04:21:06,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618a7f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:21:06, skipping insertion in model container [2024-10-13 04:21:06,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:21:04" (2/3) ... [2024-10-13 04:21:06,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618a7f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:21:06, skipping insertion in model container [2024-10-13 04:21:06,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:21:06" (3/3) ... [2024-10-13 04:21:06,539 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-63.i [2024-10-13 04:21:06,551 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:21:06,552 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:21:06,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:21:06,606 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;@51e6821e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:21:06,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:21:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:21:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 04:21:06,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:21:06,621 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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-10-13 04:21:06,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:21:06,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:21:06,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1672544830, now seen corresponding path program 1 times [2024-10-13 04:21:06,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:21:06,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589712100] [2024-10-13 04:21:06,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:06,648 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-10-13 04:21:06,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:21:06,651 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-10-13 04:21:06,651 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-10-13 04:21:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:06,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:21:06,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:21:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-10-13 04:21:06,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:21:06,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:21:06,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589712100] [2024-10-13 04:21:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589712100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:21:06,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:21:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:21:06,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495290864] [2024-10-13 04:21:06,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:21:06,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:21:06,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:21:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:21:06,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:21:06,972 INFO L87 Difference]: Start difference. First operand has 49 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 04:21:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:21:07,656 INFO L93 Difference]: Finished difference Result 95 states and 170 transitions. [2024-10-13 04:21:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:21:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 119 [2024-10-13 04:21:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:21:07,677 INFO L225 Difference]: With dead ends: 95 [2024-10-13 04:21:07,677 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 04:21:07,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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-10-13 04:21:07,682 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 04:21:07,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 04:21:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 04:21:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-13 04:21:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:21:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2024-10-13 04:21:07,723 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 119 [2024-10-13 04:21:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:21:07,723 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2024-10-13 04:21:07,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 04:21:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2024-10-13 04:21:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 04:21:07,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:21:07,725 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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-10-13 04:21:07,747 INFO L552 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)] Ended with exit code 0 [2024-10-13 04:21:07,926 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-10-13 04:21:07,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:21:07,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:21:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1211145342, now seen corresponding path program 1 times [2024-10-13 04:21:07,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:21:07,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177255440] [2024-10-13 04:21:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:21:07,930 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-10-13 04:21:07,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:21:07,949 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-10-13 04:21:07,954 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-10-13 04:21:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:21:08,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 04:21:08,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:21:20,784 WARN L286 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 04:21:37,140 WARN L286 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 04:22:02,988 WARN L286 SmtUtils]: Spent 9.62s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)