./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.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 abae505f58f5b150cd30902d50b00592ab647cc43f5107f9aaed41c2bd3b922b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:31:12,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:31:12,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:31:12,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:31:12,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:31:12,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:31:12,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:31:12,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:31:12,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:31:12,916 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:31:12,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:31:12,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:31:12,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:31:12,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:31:12,918 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:31:12,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:31:12,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:31:12,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:31:12,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:31:12,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:31:12,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:31:12,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:31:12,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:31:12,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:31:12,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:31:12,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:31:12,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:31:12,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:31:12,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:31:12,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:31:12,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:31:12,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:31:12,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:31:12,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:31:12,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:31:12,920 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:31:12,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:31:12,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:31:12,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:31:12,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:31:12,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:31:12,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:31:12,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:31:12,921 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> abae505f58f5b150cd30902d50b00592ab647cc43f5107f9aaed41c2bd3b922b [2025-03-08 14:31:13,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:31:13,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:31:13,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:31:13,151 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:31:13,151 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:31:13,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i [2025-03-08 14:31:14,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964c96962/547250b792f04eb9ad04f1c34cb0b822/FLAG9a7e1f5ae [2025-03-08 14:31:14,539 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:31:14,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i [2025-03-08 14:31:14,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964c96962/547250b792f04eb9ad04f1c34cb0b822/FLAG9a7e1f5ae [2025-03-08 14:31:14,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964c96962/547250b792f04eb9ad04f1c34cb0b822 [2025-03-08 14:31:14,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:31:14,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:31:14,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:31:14,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:31:14,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:31:14,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:31:14" (1/1) ... [2025-03-08 14:31:14,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b2814b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:14, skipping insertion in model container [2025-03-08 14:31:14,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:31:14" (1/1) ... [2025-03-08 14:31:14,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:31:14,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i[915,928] [2025-03-08 14:31:15,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:31:15,039 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:31:15,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i[915,928] [2025-03-08 14:31:15,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:31:15,079 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:31:15,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15 WrapperNode [2025-03-08 14:31:15,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:31:15,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:31:15,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:31:15,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:31:15,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,114 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-03-08 14:31:15,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:31:15,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:31:15,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:31:15,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:31:15,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,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]. [2025-03-08 14:31:15,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:31:15,163 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:31:15,163 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:31:15,163 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:31:15,164 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (1/1) ... [2025-03-08 14:31:15,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:31:15,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:31:15,194 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) [2025-03-08 14:31:15,198 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 [2025-03-08 14:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:31:15,212 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:31:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:31:15,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:31:15,268 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:31:15,270 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:31:15,438 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 14:31:15,438 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:31:15,444 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:31:15,445 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:31:15,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:31:15 BoogieIcfgContainer [2025-03-08 14:31:15,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:31:15,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:31:15,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:31:15,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:31:15,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:31:14" (1/3) ... [2025-03-08 14:31:15,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a83d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:31:15, skipping insertion in model container [2025-03-08 14:31:15,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:15" (2/3) ... [2025-03-08 14:31:15,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a83d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:31:15, skipping insertion in model container [2025-03-08 14:31:15,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:31:15" (3/3) ... [2025-03-08 14:31:15,454 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-35.i [2025-03-08 14:31:15,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:31:15,467 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-35.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:31:15,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:31:15,528 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;@18deb45b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:31:15,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:31:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 14:31:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 14:31:15,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:31:15,543 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:31:15,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:31:15,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:31:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash 573458615, now seen corresponding path program 1 times [2025-03-08 14:31:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:31:15,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537059700] [2025-03-08 14:31:15,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:31:15,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:31:15,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 14:31:15,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 14:31:15,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:31:15,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:31:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 14:31:15,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:31:15,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537059700] [2025-03-08 14:31:15,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537059700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:31:15,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477419207] [2025-03-08 14:31:15,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:31:15,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:31:15,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:31:15,772 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:31:15,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:31:15,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 14:31:15,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 14:31:15,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:31:15,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:31:15,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:31:15,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:31:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 14:31:15,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:31:15,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477419207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:31:15,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:31:15,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:31:15,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361556200] [2025-03-08 14:31:15,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:31:15,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:31:15,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:31:15,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:31:15,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:31:15,938 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 14:31:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:31:15,952 INFO L93 Difference]: Finished difference Result 104 states and 171 transitions. [2025-03-08 14:31:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:31:15,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-03-08 14:31:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:31:15,958 INFO L225 Difference]: With dead ends: 104 [2025-03-08 14:31:15,958 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 14:31:15,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:31:15,962 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:31:15,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:31:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 14:31:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 14:31:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 14:31:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-03-08 14:31:15,988 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 116 [2025-03-08 14:31:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:31:15,988 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-08 14:31:15,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 14:31:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-03-08 14:31:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 14:31:15,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:31:15,993 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:31:16,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 14:31:16,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:31:16,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:31:16,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:31:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1534804349, now seen corresponding path program 1 times [2025-03-08 14:31:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:31:16,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523016707] [2025-03-08 14:31:16,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:31:16,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:31:16,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 14:31:16,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 14:31:16,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:31:16,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:31:16,350 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:31:16,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 14:31:16,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 14:31:16,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:31:16,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:31:16,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:31:16,470 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:31:16,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:31:16,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:31:16,474 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:31:16,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:31:16,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:31:16 BoogieIcfgContainer [2025-03-08 14:31:16,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:31:16,540 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:31:16,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:31:16,541 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:31:16,541 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:31:15" (3/4) ... [2025-03-08 14:31:16,543 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:31:16,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:31:16,545 INFO L158 Benchmark]: Toolchain (without parser) took 1670.35ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 107.0MB in the end (delta: 15.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2025-03-08 14:31:16,545 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:31:16,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.89ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 109.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:31:16,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.84ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:31:16,546 INFO L158 Benchmark]: Boogie Preprocessor took 47.59ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 105.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:31:16,547 INFO L158 Benchmark]: IcfgBuilder took 282.02ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 89.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:31:16,548 INFO L158 Benchmark]: TraceAbstraction took 1092.90ms. Allocated memory is still 167.8MB. Free memory was 89.0MB in the beginning and 107.0MB in the end (delta: -18.0MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2025-03-08 14:31:16,548 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 107.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:31:16,549 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.89ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 109.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.84ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.59ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 105.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 282.02ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 89.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1092.90ms. Allocated memory is still 167.8MB. Free memory was 89.0MB in the beginning and 107.0MB in the end (delta: -18.0MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 107.0MB in the end (delta: 33.1kB). 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 96, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryArithmeticFLOAToperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 4.8; [L23] unsigned long int var_1_2 = 2; [L24] unsigned long int var_1_3 = 5; [L25] float var_1_4 = 255.1; [L26] float var_1_5 = -0.6; [L27] signed short int var_1_6 = -10; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] signed char var_1_11 = -2; [L31] signed char var_1_12 = 10; [L32] signed char var_1_13 = 5; [L33] float var_1_14 = 499.375; [L34] float var_1_15 = 0.0; [L35] float var_1_16 = 63.2; [L36] float var_1_17 = 0.0; [L37] float var_1_18 = 15.75; [L38] float var_1_19 = 5.75; VAL [isInitial=0, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_2=2, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L69] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L69] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L72] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L73] var_1_4 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L74] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L75] var_1_5 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L76] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L78] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L80] var_1_8 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L82] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L82] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L84] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L85] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L85] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L87] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L88] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L88] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L89] var_1_15 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L90] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L91] var_1_16 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L92] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L93] var_1_17 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L94] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L95] var_1_18 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L96] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L109] RET updateVariables() [L110] CALL step() [L42] unsigned long int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=4294967263, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_2=4294967263, var_1_6=-10, var_1_7=0, var_1_8=1] [L43] COND TRUE stepLocal_0 >= (~ var_1_3) [L44] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_2=4294967263, var_1_3=32, var_1_6=-10, var_1_7=0, var_1_8=1] [L46] var_1_11 = (-32 + (var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13))))) [L47] signed char stepLocal_1 = var_1_12; VAL [isInitial=1, stepLocal_1=32, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_2=4294967263, var_1_3=32, var_1_6=-10, var_1_7=0, var_1_8=1] [L48] COND FALSE !(stepLocal_1 != var_1_3) [L53] var_1_14 = var_1_18 VAL [isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=23/4, var_1_2=4294967263, var_1_3=32, var_1_6=-10, var_1_7=0, var_1_8=1] [L55] var_1_19 = var_1_5 VAL [isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-10, var_1_7=0, var_1_8=1] [L56] COND FALSE !(\read(var_1_7)) [L63] var_1_6 = var_1_11 VAL [isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-31, var_1_7=0, var_1_8=1] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return (((((var_1_2 >= (~ var_1_3)) ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) && (var_1_7 ? (var_1_8 ? (var_1_6 == ((signed short int) (var_1_11 + var_1_11))) : (var_1_6 == ((signed short int) (var_1_11 + var_1_11)))) : (var_1_6 == ((signed short int) var_1_11)))) && (var_1_11 == ((signed char) (-32 + (var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13)))))))) && ((var_1_12 != var_1_3) ? (var_1_7 ? (var_1_14 == ((float) ((var_1_15 - var_1_16) - (var_1_17 - var_1_18)))) : 1) : (var_1_14 == ((float) var_1_18)))) && (var_1_19 == ((float) var_1_5)) ; VAL [\result=0, isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-31, var_1_7=0, var_1_8=1] [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-31, var_1_7=0, var_1_8=1] [L19] reach_error() VAL [isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-31, var_1_7=0, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 97 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 74 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:31:16,566 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.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 abae505f58f5b150cd30902d50b00592ab647cc43f5107f9aaed41c2bd3b922b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:31:18,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:31:18,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:31:18,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:31:18,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:31:18,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:31:18,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:31:18,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:31:18,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:31:18,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:31:18,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:31:18,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:31:18,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:31:18,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:31:18,534 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:31:18,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:31:18,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:31:18,534 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:31:18,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:31:18,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:31:18,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:31:18,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:31:18,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:31:18,535 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:31:18,535 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:31:18,535 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:31:18,535 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:31:18,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:31:18,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:31:18,536 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:31:18,536 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:31:18,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:31:18,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:31:18,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:31:18,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:31:18,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:31:18,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:31:18,536 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:31:18,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:31:18,537 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:31:18,537 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:31:18,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:31:18,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:31:18,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:31:18,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:31:18,537 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> abae505f58f5b150cd30902d50b00592ab647cc43f5107f9aaed41c2bd3b922b [2025-03-08 14:31:18,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:31:18,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:31:18,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:31:18,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:31:18,764 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:31:18,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i [2025-03-08 14:31:19,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44a3e240/38ed709dca1f4701a603a64550bce26b/FLAG307b7ccd8 [2025-03-08 14:31:20,170 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:31:20,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i [2025-03-08 14:31:20,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44a3e240/38ed709dca1f4701a603a64550bce26b/FLAG307b7ccd8 [2025-03-08 14:31:20,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44a3e240/38ed709dca1f4701a603a64550bce26b [2025-03-08 14:31:20,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:31:20,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:31:20,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:31:20,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:31:20,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:31:20,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a4c0324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20, skipping insertion in model container [2025-03-08 14:31:20,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:31:20,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i[915,928] [2025-03-08 14:31:20,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:31:20,400 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:31:20,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i[915,928] [2025-03-08 14:31:20,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:31:20,448 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:31:20,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20 WrapperNode [2025-03-08 14:31:20,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:31:20,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:31:20,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:31:20,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:31:20,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,485 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-03-08 14:31:20,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:31:20,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:31:20,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:31:20,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:31:20,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,516 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]. [2025-03-08 14:31:20,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,524 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:31:20,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:31:20,540 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:31:20,540 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:31:20,541 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (1/1) ... [2025-03-08 14:31:20,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:31:20,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:31:20,572 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) [2025-03-08 14:31:20,574 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 [2025-03-08 14:31:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:31:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:31:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:31:20,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:31:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:31:20,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:31:20,664 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:31:20,666 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:31:22,288 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 14:31:22,288 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:31:22,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:31:22,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:31:22,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:31:22 BoogieIcfgContainer [2025-03-08 14:31:22,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:31:22,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:31:22,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:31:22,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:31:22,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:31:20" (1/3) ... [2025-03-08 14:31:22,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13846ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:31:22, skipping insertion in model container [2025-03-08 14:31:22,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:31:20" (2/3) ... [2025-03-08 14:31:22,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13846ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:31:22, skipping insertion in model container [2025-03-08 14:31:22,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:31:22" (3/3) ... [2025-03-08 14:31:22,304 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-35.i [2025-03-08 14:31:22,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:31:22,316 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-35.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:31:22,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:31:22,370 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;@15c0dda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:31:22,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:31:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 14:31:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 14:31:22,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:31:22,384 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:31:22,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:31:22,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:31:22,389 INFO L85 PathProgramCache]: Analyzing trace with hash 573458615, now seen corresponding path program 1 times [2025-03-08 14:31:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:31:22,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832413168] [2025-03-08 14:31:22,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:31:22,398 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 [2025-03-08 14:31:22,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:31:22,402 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) [2025-03-08 14:31:22,403 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 [2025-03-08 14:31:22,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 14:31:22,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 14:31:22,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:31:22,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:31:22,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:31:22,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:31:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-08 14:31:22,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:31:22,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:31:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832413168] [2025-03-08 14:31:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832413168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:31:22,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:31:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:31:22,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122679535] [2025-03-08 14:31:22,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:31:22,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:31:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:31:22,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:31:22,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:31:22,789 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 14:31:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:31:22,811 INFO L93 Difference]: Finished difference Result 104 states and 171 transitions. [2025-03-08 14:31:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:31:22,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-03-08 14:31:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:31:22,818 INFO L225 Difference]: With dead ends: 104 [2025-03-08 14:31:22,818 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 14:31:22,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:31:22,822 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:31:22,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:31:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 14:31:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 14:31:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 14:31:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-03-08 14:31:22,848 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 116 [2025-03-08 14:31:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:31:22,848 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-08 14:31:22,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 14:31:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-03-08 14:31:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 14:31:22,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:31:22,851 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:31:22,862 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 [2025-03-08 14:31:23,052 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 [2025-03-08 14:31:23,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:31:23,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:31:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1534804349, now seen corresponding path program 1 times [2025-03-08 14:31:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:31:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174110562] [2025-03-08 14:31:23,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:31:23,054 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 [2025-03-08 14:31:23,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:31:23,057 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) [2025-03-08 14:31:23,058 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 [2025-03-08 14:31:23,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 14:31:23,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 14:31:23,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:31:23,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:31:23,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 14:31:23,346 INFO L279 TraceCheckSpWp]: Computing forward predicates...