./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-1loop_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 6f582f036ce8ee2fd911e824fcfafcbbd771a7c70f7459896810d2fbb79a2be9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:27:21,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:27:22,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:27:22,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:27:22,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:27:22,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:27:22,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:27:22,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:27:22,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:27:22,036 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:27:22,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:27:22,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:27:22,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:27:22,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:27:22,037 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:27:22,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:27:22,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:27:22,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:27:22,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:27:22,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:27:22,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:27:22,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:27:22,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:27:22,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:27:22,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:27:22,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:27:22,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:27:22,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:27:22,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:27:22,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:27:22,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:27:22,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:27:22,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:27:22,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:27:22,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:27:22,040 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:27:22,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:27:22,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:27:22,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:27:22,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:27:22,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:27:22,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:27:22,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:27:22,040 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 -> 6f582f036ce8ee2fd911e824fcfafcbbd771a7c70f7459896810d2fbb79a2be9 [2025-03-17 03:27:22,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:27:22,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:27:22,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:27:22,299 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:27:22,300 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:27:22,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-35.i [2025-03-17 03:27:23,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00eea120/acde71547d104636846fb37db46dd018/FLAG3b3c0fcb7 [2025-03-17 03:27:23,764 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:27:23,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-35.i [2025-03-17 03:27:23,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00eea120/acde71547d104636846fb37db46dd018/FLAG3b3c0fcb7 [2025-03-17 03:27:23,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00eea120/acde71547d104636846fb37db46dd018 [2025-03-17 03:27:23,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:27:23,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:27:23,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:27:23,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:27:23,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:27:23,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:23" (1/1) ... [2025-03-17 03:27:23,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42007a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:23, skipping insertion in model container [2025-03-17 03:27:23,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:23" (1/1) ... [2025-03-17 03:27:23,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:27:23,921 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-1loop_file-35.i[915,928] [2025-03-17 03:27:23,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:27:23,969 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:27:23,979 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-1loop_file-35.i[915,928] [2025-03-17 03:27:24,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:27:24,014 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:27:24,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24 WrapperNode [2025-03-17 03:27:24,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:27:24,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:27:24,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:27:24,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:27:24,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,043 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-17 03:27:24,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:27:24,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:27:24,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:27:24,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:27:24,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,066 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-17 03:27:24,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:27:24,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:27:24,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:27:24,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:27:24,080 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (1/1) ... [2025-03-17 03:27:24,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:27:24,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:27:24,107 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-17 03:27:24,110 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-17 03:27:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:27:24,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:27:24,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:27:24,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:27:24,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:27:24,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:27:24,181 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:27:24,182 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:27:24,330 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:27:24,330 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:27:24,336 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:27:24,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:27:24,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:24 BoogieIcfgContainer [2025-03-17 03:27:24,337 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:27:24,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:27:24,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:27:24,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:27:24,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:27:23" (1/3) ... [2025-03-17 03:27:24,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300852d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:24, skipping insertion in model container [2025-03-17 03:27:24,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:24" (2/3) ... [2025-03-17 03:27:24,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300852d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:24, skipping insertion in model container [2025-03-17 03:27:24,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:24" (3/3) ... [2025-03-17 03:27:24,346 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-35.i [2025-03-17 03:27:24,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:27:24,359 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-35.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:27:24,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:27:24,407 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;@6cc020d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:27:24,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:27:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 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-17 03:27:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 03:27:24,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:24,423 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] [2025-03-17 03:27:24,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:24,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:24,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1082262645, now seen corresponding path program 1 times [2025-03-17 03:27:24,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:24,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503675208] [2025-03-17 03:27:24,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:24,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 03:27:24,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 03:27:24,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:24,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:24,654 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-17 03:27:24,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:27:24,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503675208] [2025-03-17 03:27:24,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503675208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:27:24,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54412802] [2025-03-17 03:27:24,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:24,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:27:24,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:27:24,659 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-17 03:27:24,661 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-17 03:27:24,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 03:27:24,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 03:27:24,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:24,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:24,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:27:24,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:27:24,831 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-17 03:27:24,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:27:24,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54412802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:24,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:27:24,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:27:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478615255] [2025-03-17 03:27:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:24,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:27:24,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:27:24,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:27:24,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:27:24,854 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 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) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-17 03:27:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:24,872 INFO L93 Difference]: Finished difference Result 99 states and 165 transitions. [2025-03-17 03:27:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:27:24,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 112 [2025-03-17 03:27:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:24,878 INFO L225 Difference]: With dead ends: 99 [2025-03-17 03:27:24,878 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 03:27:24,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-17 03:27:24,883 INFO L435 NwaCegarLoop]: 72 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, 72 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-17 03:27:24,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:27:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 03:27:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 03:27:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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-17 03:27:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2025-03-17 03:27:24,913 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 112 [2025-03-17 03:27:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:24,914 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2025-03-17 03:27:24,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-17 03:27:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2025-03-17 03:27:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 03:27:24,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:24,920 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] [2025-03-17 03:27:24,928 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-17 03:27:25,124 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-17 03:27:25,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:25,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash 334221829, now seen corresponding path program 1 times [2025-03-17 03:27:25,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:27:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019592066] [2025-03-17 03:27:25,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:27:25,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 03:27:25,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 03:27:25,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:25,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:27:25,277 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:27:25,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 03:27:25,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 03:27:25,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:25,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:27:25,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:27:25,381 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:27:25,382 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:27:25,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:27:25,385 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:27:25,449 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:27:25,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:27:25 BoogieIcfgContainer [2025-03-17 03:27:25,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:27:25,455 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:27:25,455 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:27:25,455 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:27:25,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:24" (3/4) ... [2025-03-17 03:27:25,457 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:27:25,458 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:27:25,458 INFO L158 Benchmark]: Toolchain (without parser) took 1666.10ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 56.2MB in the end (delta: 98.8MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2025-03-17 03:27:25,459 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:27:25,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.17ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 142.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:27:25,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.80ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 140.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:27:25,459 INFO L158 Benchmark]: Boogie Preprocessor took 34.96ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 138.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:27:25,459 INFO L158 Benchmark]: IcfgBuilder took 257.92ms. Allocated memory is still 201.3MB. Free memory was 138.4MB in the beginning and 122.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:27:25,460 INFO L158 Benchmark]: TraceAbstraction took 1114.95ms. Allocated memory is still 201.3MB. Free memory was 122.1MB in the beginning and 56.5MB in the end (delta: 65.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-17 03:27:25,460 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 201.3MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:27:25,461 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.22ms. Allocated memory is still 201.3MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.17ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 142.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.80ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 140.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.96ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 138.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 257.92ms. Allocated memory is still 201.3MB. Free memory was 138.4MB in the beginning and 122.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1114.95ms. Allocated memory is still 201.3MB. Free memory was 122.1MB in the beginning and 56.5MB in the end (delta: 65.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 201.3MB. Free memory is still 56.2MB. 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 101, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 74, 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; [L105] isInitial = 1 [L106] FCALL initially() [L107] int k_loop; [L108] k_loop = 0 VAL [isInitial=1, k_loop=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] [L108] COND TRUE k_loop < 1 [L109] FCALL updateLastVariables() [L110] 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=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, var_1_8=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [L110] RET updateVariables() [L111] 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=0] [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=0] [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=10, 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=0] [L48] COND FALSE !(stepLocal_1 != var_1_3) [L53] var_1_14 = var_1_18 VAL [isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967268, var_1_18=4294967268, var_1_19=23/4, var_1_2=4294967263, var_1_3=32, var_1_6=-10, var_1_7=0, var_1_8=0] [L55] var_1_19 = var_1_5 VAL [isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967268, var_1_18=4294967268, var_1_19=4294967269, var_1_2=4294967263, var_1_3=32, var_1_5=4294967269, var_1_6=-10, var_1_7=0, var_1_8=0] [L56] COND FALSE !(\read(var_1_7)) [L63] var_1_6 = var_1_11 VAL [isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967268, var_1_18=4294967268, var_1_19=4294967269, var_1_2=4294967263, var_1_3=32, var_1_5=4294967269, var_1_6=10, var_1_7=0, var_1_8=0] [L111] RET step() [L112] 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)) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967268, var_1_18=4294967268, var_1_19=4294967269, var_1_2=4294967263, var_1_3=32, var_1_5=4294967269, var_1_6=10, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967268, var_1_18=4294967268, var_1_19=4294967269, var_1_2=4294967263, var_1_3=32, var_1_5=4294967269, var_1_6=10, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 92 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, 72 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, 72 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred 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.2s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 263 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-17 03:27:25,475 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-1loop_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 6f582f036ce8ee2fd911e824fcfafcbbd771a7c70f7459896810d2fbb79a2be9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:27:27,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:27:27,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:27:27,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:27:27,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:27:27,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:27:27,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:27:27,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:27:27,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:27:27,425 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:27:27,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:27:27,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:27:27,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:27:27,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:27:27,425 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:27:27,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:27:27,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:27:27,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:27:27,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:27:27,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:27:27,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:27:27,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:27:27,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:27:27,426 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:27:27,426 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:27:27,426 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:27:27,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:27:27,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:27:27,427 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:27:27,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:27:27,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:27:27,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:27:27,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:27:27,428 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 -> 6f582f036ce8ee2fd911e824fcfafcbbd771a7c70f7459896810d2fbb79a2be9 [2025-03-17 03:27:27,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:27:27,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:27:27,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:27:27,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:27:27,704 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:27:27,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-35.i [2025-03-17 03:27:28,843 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efef6975b/409181dbdb354411b27938b9c4ee6a25/FLAG8f4456a11 [2025-03-17 03:27:29,054 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:27:29,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-35.i [2025-03-17 03:27:29,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efef6975b/409181dbdb354411b27938b9c4ee6a25/FLAG8f4456a11 [2025-03-17 03:27:29,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efef6975b/409181dbdb354411b27938b9c4ee6a25 [2025-03-17 03:27:29,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:27:29,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:27:29,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:27:29,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:27:29,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:27:29,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536d8511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29, skipping insertion in model container [2025-03-17 03:27:29,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:27:29,530 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-1loop_file-35.i[915,928] [2025-03-17 03:27:29,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:27:29,567 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:27:29,575 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-1loop_file-35.i[915,928] [2025-03-17 03:27:29,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:27:29,606 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:27:29,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29 WrapperNode [2025-03-17 03:27:29,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:27:29,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:27:29,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:27:29,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:27:29,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,647 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-17 03:27:29,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:27:29,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:27:29,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:27:29,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:27:29,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,674 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-17 03:27:29,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:27:29,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:27:29,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:27:29,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:27:29,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (1/1) ... [2025-03-17 03:27:29,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:27:29,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:27:29,728 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-17 03:27:29,730 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-17 03:27:29,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:27:29,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:27:29,745 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:27:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:27:29,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:27:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:27:29,795 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:27:29,796 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:27:31,300 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:27:31,300 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:27:31,309 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:27:31,309 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:27:31,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:31 BoogieIcfgContainer [2025-03-17 03:27:31,310 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:27:31,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:27:31,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:27:31,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:27:31,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:27:29" (1/3) ... [2025-03-17 03:27:31,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ae330e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:31, skipping insertion in model container [2025-03-17 03:27:31,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:29" (2/3) ... [2025-03-17 03:27:31,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ae330e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:31, skipping insertion in model container [2025-03-17 03:27:31,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:31" (3/3) ... [2025-03-17 03:27:31,318 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-35.i [2025-03-17 03:27:31,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:27:31,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-35.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:27:31,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:27:31,388 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;@3a9b411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:27:31,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:27:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 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-17 03:27:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 03:27:31,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:31,401 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] [2025-03-17 03:27:31,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:31,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:31,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1082262645, now seen corresponding path program 1 times [2025-03-17 03:27:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:27:31,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001037613] [2025-03-17 03:27:31,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:31,412 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-17 03:27:31,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:27:31,414 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-17 03:27:31,415 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-17 03:27:31,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 03:27:31,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 03:27:31,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:31,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:31,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:27:31,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:27:31,733 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-17 03:27:31,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:27:31,734 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:27:31,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001037613] [2025-03-17 03:27:31,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001037613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:27:31,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:27:31,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:27:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428532136] [2025-03-17 03:27:31,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:27:31,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:27:31,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:27:31,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:27:31,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:27:31,755 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 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) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-17 03:27:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:27:31,773 INFO L93 Difference]: Finished difference Result 99 states and 165 transitions. [2025-03-17 03:27:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:27:31,774 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 112 [2025-03-17 03:27:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:27:31,779 INFO L225 Difference]: With dead ends: 99 [2025-03-17 03:27:31,779 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 03:27:31,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-17 03:27:31,786 INFO L435 NwaCegarLoop]: 72 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, 72 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-17 03:27:31,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:27:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 03:27:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 03:27:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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-17 03:27:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2025-03-17 03:27:31,821 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 112 [2025-03-17 03:27:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:27:31,822 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2025-03-17 03:27:31,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-17 03:27:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2025-03-17 03:27:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 03:27:31,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:27:31,827 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] [2025-03-17 03:27:31,838 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-17 03:27:32,028 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-17 03:27:32,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:27:32,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:27:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash 334221829, now seen corresponding path program 1 times [2025-03-17 03:27:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:27:32,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840263030] [2025-03-17 03:27:32,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:27:32,030 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-17 03:27:32,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:27:32,032 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-17 03:27:32,033 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-17 03:27:32,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 03:27:32,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 03:27:32,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:27:32,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:27:32,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 03:27:32,317 INFO L279 TraceCheckSpWp]: Computing forward predicates...