./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.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_50-while_file-88.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 3452d43faab40597a0b43ba1622139d82627c4d75f29678e42763287f2e5defc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:08:05,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:08:05,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:08:05,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:08:05,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:08:05,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:08:05,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:08:05,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:08:05,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:08:05,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:08:05,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:08:05,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:08:05,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:08:05,834 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:08:05,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:08:05,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:08:05,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:08:05,835 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 -> 3452d43faab40597a0b43ba1622139d82627c4d75f29678e42763287f2e5defc [2025-03-17 04:08:06,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:08:06,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:08:06,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:08:06,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:08:06,059 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:08:06,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i [2025-03-17 04:08:07,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2db15014/e31960be3c7944a092868df202416c3c/FLAGbebe4399d [2025-03-17 04:08:07,385 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:08:07,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i [2025-03-17 04:08:07,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2db15014/e31960be3c7944a092868df202416c3c/FLAGbebe4399d [2025-03-17 04:08:07,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2db15014/e31960be3c7944a092868df202416c3c [2025-03-17 04:08:07,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:08:07,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:08:07,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:08:07,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:08:07,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:08:07,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1925ccfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07, skipping insertion in model container [2025-03-17 04:08:07,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:08:07,540 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_50-while_file-88.i[915,928] [2025-03-17 04:08:07,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:08:07,608 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:08:07,618 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_50-while_file-88.i[915,928] [2025-03-17 04:08:07,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:08:07,670 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:08:07,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07 WrapperNode [2025-03-17 04:08:07,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:08:07,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:08:07,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:08:07,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:08:07,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,728 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2025-03-17 04:08:07,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:08:07,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:08:07,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:08:07,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:08:07,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,761 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 04:08:07,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:08:07,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:08:07,781 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:08:07,781 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:08:07,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (1/1) ... [2025-03-17 04:08:07,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:08:07,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:08:07,811 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 04:08:07,817 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 04:08:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:08:07,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:08:07,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:08:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:08:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:08:07,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:08:07,885 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:08:07,887 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:08:08,140 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: havoc property_#t~bitwise20#1;havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short23#1; [2025-03-17 04:08:08,170 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-17 04:08:08,170 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:08:08,182 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:08:08,182 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:08:08,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:08:08 BoogieIcfgContainer [2025-03-17 04:08:08,183 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:08:08,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:08:08,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:08:08,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:08:08,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:08:07" (1/3) ... [2025-03-17 04:08:08,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed9d2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:08:08, skipping insertion in model container [2025-03-17 04:08:08,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:07" (2/3) ... [2025-03-17 04:08:08,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed9d2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:08:08, skipping insertion in model container [2025-03-17 04:08:08,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:08:08" (3/3) ... [2025-03-17 04:08:08,190 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-88.i [2025-03-17 04:08:08,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:08:08,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-88.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:08:08,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:08:08,249 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;@53a4347d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:08:08,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:08:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 04:08:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 04:08:08,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:08:08,265 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:08,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:08:08,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:08:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash 286013909, now seen corresponding path program 1 times [2025-03-17 04:08:08,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:08:08,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034361109] [2025-03-17 04:08:08,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:08:08,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:08:08,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 04:08:08,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 04:08:08,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:08,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:08:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 04:08:08,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:08:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034361109] [2025-03-17 04:08:08,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034361109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:08:08,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869832881] [2025-03-17 04:08:08,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:08:08,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:08:08,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:08:08,530 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 04:08:08,532 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 04:08:08,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 04:08:08,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 04:08:08,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:08,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:08:08,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:08:08,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:08:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 04:08:08,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:08:08,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869832881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:08:08,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:08:08,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:08:08,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097012224] [2025-03-17 04:08:08,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:08:08,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:08:08,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:08:08,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:08:08,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:08:08,730 INFO L87 Difference]: Start difference. First operand has 82 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 04:08:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:08:08,764 INFO L93 Difference]: Finished difference Result 161 states and 274 transitions. [2025-03-17 04:08:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:08:08,766 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 154 [2025-03-17 04:08:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:08:08,772 INFO L225 Difference]: With dead ends: 161 [2025-03-17 04:08:08,772 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 04:08:08,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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 04:08:08,779 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:08:08,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:08:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 04:08:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 04:08:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 04:08:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2025-03-17 04:08:08,815 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 154 [2025-03-17 04:08:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:08:08,815 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2025-03-17 04:08:08,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 04:08:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2025-03-17 04:08:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 04:08:08,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:08:08,818 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:08,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:08:09,019 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 04:08:09,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:08:09,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:08:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1232660527, now seen corresponding path program 1 times [2025-03-17 04:08:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:08:09,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739391153] [2025-03-17 04:08:09,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:08:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:08:09,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 04:08:09,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 04:08:09,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:09,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:08:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 04:08:09,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:08:09,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739391153] [2025-03-17 04:08:09,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739391153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:08:09,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736956734] [2025-03-17 04:08:09,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:08:09,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:08:09,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:08:09,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:08:09,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:08:09,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 04:08:09,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 04:08:09,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:09,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:08:09,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 04:08:09,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:08:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-17 04:08:09,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:08:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 04:08:10,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736956734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:08:10,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:08:10,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-17 04:08:10,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092228762] [2025-03-17 04:08:10,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:08:10,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:08:10,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:08:10,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:08:10,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:08:10,175 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 04:08:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:08:10,400 INFO L93 Difference]: Finished difference Result 167 states and 250 transitions. [2025-03-17 04:08:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 04:08:10,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 154 [2025-03-17 04:08:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:08:10,404 INFO L225 Difference]: With dead ends: 167 [2025-03-17 04:08:10,404 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 04:08:10,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:08:10,405 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 156 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:08:10,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 300 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:08:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 04:08:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2025-03-17 04:08:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 04:08:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2025-03-17 04:08:10,418 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 154 [2025-03-17 04:08:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:08:10,418 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2025-03-17 04:08:10,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 04:08:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2025-03-17 04:08:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 04:08:10,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:08:10,420 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:10,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:08:10,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 04:08:10,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:08:10,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:08:10,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2120164208, now seen corresponding path program 1 times [2025-03-17 04:08:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:08:10,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458541922] [2025-03-17 04:08:10,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:08:10,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:08:10,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 04:08:10,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 04:08:10,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:10,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:08:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 162 proven. 27 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2025-03-17 04:08:11,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:08:11,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458541922] [2025-03-17 04:08:11,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458541922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:08:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109923008] [2025-03-17 04:08:11,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:08:11,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:08:11,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:08:11,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:08:11,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:08:11,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 04:08:11,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 04:08:11,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:11,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:08:11,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 04:08:11,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:08:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 510 proven. 27 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2025-03-17 04:08:12,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:08:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 162 proven. 36 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2025-03-17 04:08:12,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109923008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:08:12,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:08:12,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 35 [2025-03-17 04:08:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731388141] [2025-03-17 04:08:12,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:08:12,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 04:08:12,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:08:12,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 04:08:12,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 04:08:12,903 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2025-03-17 04:08:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:08:15,269 INFO L93 Difference]: Finished difference Result 469 states and 665 transitions. [2025-03-17 04:08:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-17 04:08:15,269 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) Word has length 154 [2025-03-17 04:08:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:08:15,275 INFO L225 Difference]: With dead ends: 469 [2025-03-17 04:08:15,275 INFO L226 Difference]: Without dead ends: 386 [2025-03-17 04:08:15,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=889, Invalid=2893, Unknown=0, NotChecked=0, Total=3782 [2025-03-17 04:08:15,281 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 444 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:08:15,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1499 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 04:08:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-17 04:08:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 156. [2025-03-17 04:08:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 108 states have (on average 1.287037037037037) internal successors, (139), 109 states have internal predecessors, (139), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 04:08:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 219 transitions. [2025-03-17 04:08:15,341 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 219 transitions. Word has length 154 [2025-03-17 04:08:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:08:15,341 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 219 transitions. [2025-03-17 04:08:15,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2025-03-17 04:08:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2025-03-17 04:08:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 04:08:15,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:08:15,344 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:15,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 04:08:15,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:08:15,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:08:15,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:08:15,546 INFO L85 PathProgramCache]: Analyzing trace with hash -667251279, now seen corresponding path program 1 times [2025-03-17 04:08:15,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:08:15,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955191961] [2025-03-17 04:08:15,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:08:15,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:08:15,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 04:08:15,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 04:08:15,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:15,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:08:15,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078168938] [2025-03-17 04:08:15,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:08:15,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:08:15,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:08:15,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:08:15,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 04:08:15,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 04:08:15,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 04:08:15,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:15,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:08:15,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:08:15,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 04:08:15,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 04:08:15,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:15,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:08:15,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:08:15,780 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:08:15,781 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:08:15,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 04:08:15,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:08:15,985 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 04:08:16,045 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:08:16,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:08:16 BoogieIcfgContainer [2025-03-17 04:08:16,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:08:16,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:08:16,051 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:08:16,051 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:08:16,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:08:08" (3/4) ... [2025-03-17 04:08:16,054 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:08:16,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:08:16,055 INFO L158 Benchmark]: Toolchain (without parser) took 8631.97ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 106.1MB in the beginning and 218.9MB in the end (delta: -112.8MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2025-03-17 04:08:16,055 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:08:16,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.58ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 90.9MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 04:08:16,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.06ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 87.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:08:16,055 INFO L158 Benchmark]: Boogie Preprocessor took 49.93ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 82.6MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:08:16,055 INFO L158 Benchmark]: IcfgBuilder took 402.23ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 56.5MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 04:08:16,055 INFO L158 Benchmark]: TraceAbstraction took 7865.40ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 55.6MB in the beginning and 219.0MB in the end (delta: -163.3MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2025-03-17 04:08:16,056 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 310.4MB. Free memory was 219.0MB in the beginning and 218.9MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:08:16,056 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.21ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.58ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 90.9MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.06ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 87.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.93ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 82.6MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 402.23ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 56.5MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7865.40ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 55.6MB in the beginning and 219.0MB in the end (delta: -163.3MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 310.4MB. Free memory was 219.0MB in the beginning and 218.9MB in the end (delta: 92.3kB). 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 101, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] float var_1_2 = 9.5; [L24] float var_1_4 = 127.6; [L25] double var_1_5 = 100000000000000.5; [L26] double var_1_6 = 100000000000000.7; [L27] double var_1_7 = 256.75; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 1; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] signed char var_1_12 = 0; [L33] signed char var_1_13 = 2; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_16 = 10; [L36] unsigned char var_1_18 = 4; [L37] unsigned char var_1_19 = 8; [L38] unsigned char var_1_20 = 8; [L39] unsigned short int var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned short int var_1_24 = 34649; [L42] unsigned char last_1_var_1_8 = 0; [L43] unsigned short int last_1_var_1_21 = 128; [L44] unsigned char last_1_var_1_22 = 0; [L147] isInitial = 1 [L148] FCALL initially() [L149] COND TRUE 1 [L150] CALL updateLastVariables() [L138] last_1_var_1_8 = var_1_8 [L139] last_1_var_1_21 = var_1_21 [L140] last_1_var_1_22 = var_1_22 [L150] RET updateLastVariables() [L151] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] 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, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L103] 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, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L104] var_1_6 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L106] var_1_7 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L107] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L109] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L113] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L113] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L114] var_1_11 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L116] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L117] var_1_13 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L118] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L119] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_16 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_16 <= 255) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L123] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L123] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L124] var_1_18 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L126] CALL assume_abort_if_not(var_1_18 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L126] RET assume_abort_if_not(var_1_18 <= 64) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L127] var_1_19 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L129] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L130] var_1_20 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L132] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L133] var_1_24 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L151] RET updateVariables() [L152] CALL step() [L48] COND FALSE !(64.5f <= var_1_2) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L59] COND FALSE !(var_1_1 > ((var_1_1 * var_1_5) + 5.3)) [L66] var_1_8 = var_1_11 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L68] signed long int stepLocal_0 = (last_1_var_1_22 / var_1_16) * last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L69] COND FALSE !(last_1_var_1_21 < stepLocal_0) [L72] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L74] EXPR var_1_18 << var_1_14 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L74] signed long int stepLocal_3 = var_1_18 << var_1_14; [L75] EXPR var_1_14 | var_1_18 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L75] signed long int stepLocal_2 = (var_1_14 | var_1_18) / (var_1_24 - 1); [L76] COND FALSE !(var_1_19 == stepLocal_3) [L83] var_1_22 = 64 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L85] COND FALSE !(((- var_1_1) / 24.75) < var_1_6) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L92] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L93] COND FALSE !(var_1_8 && stepLocal_1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L152] RET step() [L153] CALL, EXPR property() [L143] EXPR ((((((64.5f <= var_1_2) ? (last_1_var_1_8 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_1 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_1) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_1) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_1) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((last_1_var_1_21 < ((last_1_var_1_22 / var_1_16) * last_1_var_1_21)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_8 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_14)) ? ((last_1_var_1_22 >= ((var_1_14 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L143-L144] return ((((((64.5f <= var_1_2) ? (last_1_var_1_8 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_1 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_1) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_1) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_1) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((last_1_var_1_21 < ((last_1_var_1_22 / var_1_16) * last_1_var_1_21)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_8 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_14)) ? ((last_1_var_1_22 >= ((var_1_14 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) ; [L153] RET, EXPR property() [L153] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 150 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 623 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 600 mSDsluCounter, 1917 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1540 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2574 IncrementalHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 377 mSDtfsCounter, 2574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 827 GetRequests, 755 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=3, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 234 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1232 NumberOfCodeBlocks, 1232 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1224 ConstructedInterpolants, 0 QuantifiedInterpolants, 3307 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1047 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 8561/8832 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 04:08:16,080 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_50-while_file-88.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 3452d43faab40597a0b43ba1622139d82627c4d75f29678e42763287f2e5defc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:08:17,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:08:18,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:08:18,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:08:18,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:08:18,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:08:18,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:08:18,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:08:18,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:08:18,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:08:18,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:08:18,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:08:18,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:08:18,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:08:18,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:08:18,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:08:18,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:08:18,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:08:18,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:08:18,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:08:18,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:08:18,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:08:18,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:08:18,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:08:18,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:08:18,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:08:18,051 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:08:18,052 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:08:18,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:08:18,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:08:18,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:08:18,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:08:18,052 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 -> 3452d43faab40597a0b43ba1622139d82627c4d75f29678e42763287f2e5defc [2025-03-17 04:08:18,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:08:18,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:08:18,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:08:18,303 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:08:18,304 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:08:18,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i [2025-03-17 04:08:19,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b615d615/0b4ebf9ae1f248d69d93f7203685b1ed/FLAGa60a4b31a [2025-03-17 04:08:19,625 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:08:19,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i [2025-03-17 04:08:19,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b615d615/0b4ebf9ae1f248d69d93f7203685b1ed/FLAGa60a4b31a [2025-03-17 04:08:19,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b615d615/0b4ebf9ae1f248d69d93f7203685b1ed [2025-03-17 04:08:19,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:08:19,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:08:19,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:08:19,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:08:19,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:08:19,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:08:19" (1/1) ... [2025-03-17 04:08:19,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aea142f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:19, skipping insertion in model container [2025-03-17 04:08:19,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:08:19" (1/1) ... [2025-03-17 04:08:20,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:08:20,110 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_50-while_file-88.i[915,928] [2025-03-17 04:08:20,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:08:20,161 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:08:20,168 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_50-while_file-88.i[915,928] [2025-03-17 04:08:20,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:08:20,197 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:08:20,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20 WrapperNode [2025-03-17 04:08:20,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:08:20,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:08:20,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:08:20,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:08:20,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,233 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2025-03-17 04:08:20,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:08:20,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:08:20,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:08:20,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:08:20,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,251 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 04:08:20,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:08:20,268 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:08:20,268 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:08:20,268 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:08:20,269 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (1/1) ... [2025-03-17 04:08:20,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:08:20,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:08:20,297 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 04:08:20,300 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 04:08:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:08:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:08:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:08:20,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:08:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:08:20,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:08:20,376 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:08:20,378 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:08:34,924 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 04:08:34,924 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:08:34,932 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:08:34,933 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:08:34,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:08:34 BoogieIcfgContainer [2025-03-17 04:08:34,933 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:08:34,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:08:34,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:08:34,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:08:34,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:08:19" (1/3) ... [2025-03-17 04:08:34,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93f89af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:08:34, skipping insertion in model container [2025-03-17 04:08:34,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:08:20" (2/3) ... [2025-03-17 04:08:34,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93f89af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:08:34, skipping insertion in model container [2025-03-17 04:08:34,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:08:34" (3/3) ... [2025-03-17 04:08:34,944 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-88.i [2025-03-17 04:08:34,956 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:08:34,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-88.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:08:34,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:08:35,005 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;@315ae7a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:08:35,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:08:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 04:08:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 04:08:35,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:08:35,017 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:35,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:08:35,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:08:35,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1395790791, now seen corresponding path program 1 times [2025-03-17 04:08:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:08:35,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292099625] [2025-03-17 04:08:35,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:08:35,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 04:08:35,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:08:35,032 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 04:08:35,032 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 04:08:35,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 04:08:35,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 04:08:35,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:35,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:08:35,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:08:35,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:08:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-17 04:08:35,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:08:35,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:08:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292099625] [2025-03-17 04:08:35,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292099625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:08:35,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:08:35,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:08:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027886524] [2025-03-17 04:08:35,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:08:35,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:08:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:08:35,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:08:35,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:08:35,755 INFO L87 Difference]: Start difference. First operand has 65 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 04:08:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:08:35,774 INFO L93 Difference]: Finished difference Result 127 states and 224 transitions. [2025-03-17 04:08:35,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:08:35,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2025-03-17 04:08:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:08:35,780 INFO L225 Difference]: With dead ends: 127 [2025-03-17 04:08:35,780 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 04:08:35,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 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 04:08:35,784 INFO L435 NwaCegarLoop]: 97 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, 97 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 04:08:35,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:08:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 04:08:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 04:08:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 04:08:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2025-03-17 04:08:35,816 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 148 [2025-03-17 04:08:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:08:35,817 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2025-03-17 04:08:35,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 04:08:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2025-03-17 04:08:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 04:08:35,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:08:35,821 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:35,839 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 04:08:36,021 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 04:08:36,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:08:36,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:08:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash 646637075, now seen corresponding path program 1 times [2025-03-17 04:08:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:08:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883333020] [2025-03-17 04:08:36,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:08:36,023 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 04:08:36,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:08:36,025 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 04:08:36,027 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 04:08:36,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 04:08:36,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 04:08:36,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:08:36,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:08:36,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 04:08:36,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:08:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-17 04:08:38,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:08:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-17 04:08:40,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:08:40,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883333020] [2025-03-17 04:08:40,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883333020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:08:40,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 04:08:40,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-17 04:08:40,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579684696] [2025-03-17 04:08:40,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 04:08:40,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:08:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:08:40,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:08:40,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:08:40,345 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-17 04:08:45,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:08:50,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:08:54,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:08:58,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:09:02,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:09:06,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:09:10,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:09:14,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:09:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:09:15,408 INFO L93 Difference]: Finished difference Result 203 states and 303 transitions. [2025-03-17 04:09:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 04:09:15,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 148 [2025-03-17 04:09:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:09:15,412 INFO L225 Difference]: With dead ends: 203 [2025-03-17 04:09:15,412 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 04:09:15,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-17 04:09:15,416 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 129 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 82 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:09:15,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 216 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 34.1s Time] [2025-03-17 04:09:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 04:09:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 76. [2025-03-17 04:09:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 04:09:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2025-03-17 04:09:15,430 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 148 [2025-03-17 04:09:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:09:15,431 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2025-03-17 04:09:15,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-17 04:09:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2025-03-17 04:09:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 04:09:15,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:09:15,432 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:15,453 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 (3)] Ended with exit code 0 [2025-03-17 04:09:15,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:09:15,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:09:15,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:09:15,634 INFO L85 PathProgramCache]: Analyzing trace with hash 646666866, now seen corresponding path program 1 times [2025-03-17 04:09:15,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:09:15,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875756954] [2025-03-17 04:09:15,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:09:15,634 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 04:09:15,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:09:15,637 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:09:15,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 04:09:15,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 04:09:16,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 04:09:16,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:09:16,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:09:16,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 04:09:16,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:09:33,292 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:09:45,003 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)