./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_100-1loop_file-49.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 da9b723eb6764db01c7e9bf3efd61044ec19f10f8fa82b3808d599b247834486 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:46:56,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:46:56,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:46:56,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:46:56,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:46:56,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:46:56,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:46:56,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:46:56,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:46:56,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:46:56,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:46:56,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:46:56,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:46:56,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:46:56,331 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:46:56,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:46:56,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:46:56,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:46:56,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:46:56,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:46:56,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:46:56,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:46:56,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:46:56,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:46:56,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:46:56,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:46:56,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:46:56,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:46:56,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:46:56,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:46:56,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:46:56,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:46:56,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:46:56,334 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 -> da9b723eb6764db01c7e9bf3efd61044ec19f10f8fa82b3808d599b247834486 [2025-03-03 22:46:56,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:46:56,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:46:56,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:46:56,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:46:56,564 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:46:56,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-03-03 22:46:57,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2b07eb0/ce40bf4a3e5d4f0b83d3b8f1ccd8be48/FLAG7a9453c4f [2025-03-03 22:46:57,961 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:46:57,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-03-03 22:46:57,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2b07eb0/ce40bf4a3e5d4f0b83d3b8f1ccd8be48/FLAG7a9453c4f [2025-03-03 22:46:58,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2b07eb0/ce40bf4a3e5d4f0b83d3b8f1ccd8be48 [2025-03-03 22:46:58,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:46:58,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:46:58,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:46:58,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:46:58,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:46:58,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60521337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58, skipping insertion in model container [2025-03-03 22:46:58,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:46:58,421 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_100-1loop_file-49.i[916,929] [2025-03-03 22:46:58,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:46:58,512 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:46:58,521 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_100-1loop_file-49.i[916,929] [2025-03-03 22:46:58,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:46:58,570 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:46:58,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58 WrapperNode [2025-03-03 22:46:58,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:46:58,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:46:58,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:46:58,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:46:58,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,617 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-03-03 22:46:58,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:46:58,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:46:58,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:46:58,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:46:58,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,643 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-03 22:46:58,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:46:58,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:46:58,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:46:58,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:46:58,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (1/1) ... [2025-03-03 22:46:58,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:46:58,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:46:58,696 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-03 22:46:58,699 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-03 22:46:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:46:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:46:58,713 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:46:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:46:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:46:58,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:46:58,764 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:46:58,765 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:46:59,064 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-03 22:46:59,064 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:46:59,075 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:46:59,076 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:46:59,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:59 BoogieIcfgContainer [2025-03-03 22:46:59,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:46:59,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:46:59,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:46:59,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:46:59,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:46:58" (1/3) ... [2025-03-03 22:46:59,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209f1cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:46:59, skipping insertion in model container [2025-03-03 22:46:59,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:58" (2/3) ... [2025-03-03 22:46:59,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209f1cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:46:59, skipping insertion in model container [2025-03-03 22:46:59,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:59" (3/3) ... [2025-03-03 22:46:59,084 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-03-03 22:46:59,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:46:59,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-49.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:46:59,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:46:59,141 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;@2c0cfb7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:46:59,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:46:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:46:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 22:46:59,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:46:59,156 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:46:59,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:46:59,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:46:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash -169906250, now seen corresponding path program 1 times [2025-03-03 22:46:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:46:59,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116474267] [2025-03-03 22:46:59,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:46:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:46:59,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:46:59,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:46:59,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:46:59,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:46:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 22:46:59,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:46:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116474267] [2025-03-03 22:46:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116474267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:46:59,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22654207] [2025-03-03 22:46:59,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:46:59,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:46:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:46:59,448 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-03 22:46:59,450 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-03 22:46:59,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:46:59,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:46:59,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:46:59,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:46:59,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:46:59,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:46:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 22:46:59,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:46:59,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22654207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:46:59,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:46:59,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:46:59,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480021133] [2025-03-03 22:46:59,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:46:59,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:46:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:46:59,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:46:59,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:46:59,646 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 22:46:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:46:59,662 INFO L93 Difference]: Finished difference Result 167 states and 287 transitions. [2025-03-03 22:46:59,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:46:59,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-03-03 22:46:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:46:59,668 INFO L225 Difference]: With dead ends: 167 [2025-03-03 22:46:59,668 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 22:46:59,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-03 22:46:59,672 INFO L435 NwaCegarLoop]: 130 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, 130 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-03 22:46:59,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:46:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 22:46:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 22:46:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:46:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2025-03-03 22:46:59,701 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 171 [2025-03-03 22:46:59,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:46:59,701 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2025-03-03 22:46:59,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 22:46:59,701 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2025-03-03 22:46:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 22:46:59,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:46:59,703 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:46:59,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:46:59,908 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-03 22:46:59,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:46:59,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:46:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash -36591154, now seen corresponding path program 1 times [2025-03-03 22:46:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:46:59,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523376690] [2025-03-03 22:46:59,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:46:59,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:46:59,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:47:00,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:47:00,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:00,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 22:47:01,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:47:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523376690] [2025-03-03 22:47:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523376690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:47:01,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:47:01,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:47:01,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557807222] [2025-03-03 22:47:01,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:47:01,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:47:01,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:47:01,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:47:01,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:47:01,602 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 22:47:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:47:02,122 INFO L93 Difference]: Finished difference Result 269 states and 414 transitions. [2025-03-03 22:47:02,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:47:02,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-03 22:47:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:47:02,124 INFO L225 Difference]: With dead ends: 269 [2025-03-03 22:47:02,124 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 22:47:02,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:47:02,128 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 178 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:47:02,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 448 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:47:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 22:47:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2025-03-03 22:47:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 120 states have (on average 1.375) internal successors, (165), 122 states have internal predecessors, (165), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 22:47:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 285 transitions. [2025-03-03 22:47:02,166 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 285 transitions. Word has length 171 [2025-03-03 22:47:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:47:02,167 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 285 transitions. [2025-03-03 22:47:02,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 22:47:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 285 transitions. [2025-03-03 22:47:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 22:47:02,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:02,170 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:47:02,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:47:02,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:02,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1833542513, now seen corresponding path program 1 times [2025-03-03 22:47:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:47:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662859893] [2025-03-03 22:47:02,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:47:02,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:47:02,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:47:02,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:02,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 22:47:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:47:02,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662859893] [2025-03-03 22:47:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662859893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:47:02,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:47:02,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:47:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499316650] [2025-03-03 22:47:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:47:02,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:47:02,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:47:02,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:47:02,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:47:02,420 INFO L87 Difference]: Start difference. First operand 184 states and 285 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 22:47:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:47:02,575 INFO L93 Difference]: Finished difference Result 507 states and 782 transitions. [2025-03-03 22:47:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:47:02,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-03 22:47:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:47:02,580 INFO L225 Difference]: With dead ends: 507 [2025-03-03 22:47:02,580 INFO L226 Difference]: Without dead ends: 326 [2025-03-03 22:47:02,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:47:02,582 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 71 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:47:02,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 305 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:47:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-03 22:47:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 240. [2025-03-03 22:47:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 163 states have (on average 1.392638036809816) internal successors, (227), 166 states have internal predecessors, (227), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:47:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 371 transitions. [2025-03-03 22:47:02,627 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 371 transitions. Word has length 171 [2025-03-03 22:47:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:47:02,630 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 371 transitions. [2025-03-03 22:47:02,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 22:47:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 371 transitions. [2025-03-03 22:47:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:47:02,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:02,632 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:47:02,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:47:02,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:02,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1186873666, now seen corresponding path program 1 times [2025-03-03 22:47:02,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:47:02,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651565886] [2025-03-03 22:47:02,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:02,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:47:02,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:47:02,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:47:02,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:02,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 42 proven. 33 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 22:47:03,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:47:03,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651565886] [2025-03-03 22:47:03,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651565886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:47:03,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533980557] [2025-03-03 22:47:03,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:03,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:47:03,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:47:03,490 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-03 22:47:03,495 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-03 22:47:03,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:47:03,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:47:03,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:03,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:03,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 22:47:03,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:47:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 669 proven. 33 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-03-03 22:47:08,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:47:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533980557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:47:09,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:47:09,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2025-03-03 22:47:09,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722720699] [2025-03-03 22:47:09,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:47:09,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:47:09,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:47:09,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:47:09,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2025-03-03 22:47:09,046 INFO L87 Difference]: Start difference. First operand 240 states and 371 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2025-03-03 22:47:14,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:47:18,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:47:19,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 22:47:24,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:47:25,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:47:29,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:47:32,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 22:47:36,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:47:40,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:47:42,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 22:47:46,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 22:47:47,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 22:47:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:47:49,953 INFO L93 Difference]: Finished difference Result 495 states and 753 transitions. [2025-03-03 22:47:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:47:49,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 172 [2025-03-03 22:47:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:47:49,957 INFO L225 Difference]: With dead ends: 495 [2025-03-03 22:47:49,957 INFO L226 Difference]: Without dead ends: 258 [2025-03-03 22:47:49,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=88, Invalid=253, Unknown=1, NotChecked=0, Total=342 [2025-03-03 22:47:49,960 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 200 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 60 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:47:49,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 482 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 488 Invalid, 7 Unknown, 0 Unchecked, 39.5s Time] [2025-03-03 22:47:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-03 22:47:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2025-03-03 22:47:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 172 states have (on average 1.3488372093023255) internal successors, (232), 175 states have internal predecessors, (232), 72 states have call successors, (72), 7 states have call predecessors, (72), 7 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:47:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2025-03-03 22:47:49,998 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 172 [2025-03-03 22:47:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:47:49,998 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2025-03-03 22:47:49,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2025-03-03 22:47:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2025-03-03 22:47:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:47:50,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:50,000 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:47:50,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 22:47:50,201 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,SelfDestructingSolverStorable3 [2025-03-03 22:47:50,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:50,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1057790947, now seen corresponding path program 1 times [2025-03-03 22:47:50,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:47:50,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492192586] [2025-03-03 22:47:50,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:50,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:47:50,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:47:50,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:47:50,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:50,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:47:50,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [133151366] [2025-03-03 22:47:50,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:50,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:47:50,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:47:50,360 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-03 22:47:50,361 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-03 22:47:50,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:47:50,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:47:50,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:50,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:47:50,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:47:50,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:47:51,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:47:51,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:51,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:47:51,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:47:51,088 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:47:51,089 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:47:51,098 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-03 22:47:51,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:47:51,298 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 22:47:51,376 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:47:51,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:47:51 BoogieIcfgContainer [2025-03-03 22:47:51,379 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:47:51,379 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:47:51,379 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:47:51,379 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:47:51,380 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:59" (3/4) ... [2025-03-03 22:47:51,381 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:47:51,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:47:51,382 INFO L158 Benchmark]: Toolchain (without parser) took 53095.04ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 119.9MB in the beginning and 78.6MB in the end (delta: 41.3MB). Peak memory consumption was 128.2MB. Max. memory is 16.1GB. [2025-03-03 22:47:51,382 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:47:51,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.14ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 104.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:47:51,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.53ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 100.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:47:51,383 INFO L158 Benchmark]: Boogie Preprocessor took 51.80ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 94.4MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:47:51,383 INFO L158 Benchmark]: IcfgBuilder took 405.81ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 67.4MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 22:47:51,383 INFO L158 Benchmark]: TraceAbstraction took 52300.92ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 67.0MB in the beginning and 78.7MB in the end (delta: -11.7MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2025-03-03 22:47:51,384 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 251.7MB. Free memory was 78.7MB in the beginning and 78.6MB in the end (delta: 64.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:47:51,385 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.20ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.14ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 104.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.53ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 100.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.80ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 94.4MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 405.81ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 67.4MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 52300.92ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 67.0MB in the beginning and 78.7MB in the end (delta: -11.7MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 251.7MB. Free memory was 78.7MB in the beginning and 78.6MB in the end (delta: 64.6kB). 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 someBinaryArithmeticDOUBLEoperation at line 90, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 16; [L23] signed char var_1_3 = -5; [L24] double var_1_5 = 2.65; [L25] double var_1_6 = 100.375; [L26] double var_1_7 = 5.7; [L27] double var_1_8 = 0.1; [L28] double var_1_9 = 9999.4; [L29] double var_1_10 = 63.375; [L30] signed char var_1_11 = 1; [L31] double var_1_12 = 3.875; [L32] unsigned long int var_1_13 = 2; [L33] double var_1_14 = 1.375; [L34] float var_1_16 = 32.4; [L35] double var_1_17 = 255.25; [L36] unsigned char var_1_19 = 1; [L37] unsigned char var_1_20 = 1; [L38] unsigned char var_1_21 = 50; [L39] unsigned char var_1_22 = 1; [L40] unsigned char var_1_23 = 0; [L41] unsigned char var_1_24 = 0; [L42] double var_1_25 = -0.8; [L43] unsigned short int var_1_26 = 16; [L44] signed short int var_1_28 = -32; [L45] signed short int var_1_29 = 5; [L46] unsigned char var_1_30 = 0; [L47] unsigned char var_1_31 = 0; [L48] float last_1_var_1_16 = 32.4; [L49] unsigned char last_1_var_1_19 = 1; [L50] unsigned char last_1_var_1_30 = 0; VAL [isInitial=0, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-5, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L192] isInitial = 1 [L193] FCALL initially() [L194] int k_loop; [L195] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-5, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L195] COND TRUE k_loop < 1 [L196] CALL updateLastVariables() [L183] last_1_var_1_16 = var_1_16 [L184] last_1_var_1_19 = var_1_19 [L185] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-5, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L141] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L142] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L142] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L143] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L143] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L144] var_1_6 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L146] var_1_7 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L148] var_1_8 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_9=49997/5] [L149] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20, var_1_9=49997/5] [L150] var_1_9 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L151] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L152] var_1_11 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L153] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L154] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L154] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L155] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L155] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L156] var_1_12 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L157] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L158] var_1_14 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L159] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L160] var_1_20 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L161] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L162] CALL assume_abort_if_not(var_1_20 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L162] RET assume_abort_if_not(var_1_20 <= 128) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L163] var_1_21 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_21 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L164] RET assume_abort_if_not(var_1_21 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L165] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L165] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L166] var_1_22 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L167] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L168] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L168] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L169] var_1_23 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L170] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L171] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L171] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L172] var_1_24 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L173] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L174] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L174] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L175] var_1_29 = __VERIFIER_nondet_short() [L176] CALL assume_abort_if_not(var_1_29 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L176] RET assume_abort_if_not(var_1_29 >= -16383) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L177] CALL assume_abort_if_not(var_1_29 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L177] RET assume_abort_if_not(var_1_29 <= 16383) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=0, var_1_3=2, var_1_5=53/20] [L178] var_1_31 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L179] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L197] RET updateVariables() [L198] CALL step() [L54] unsigned char stepLocal_6 = var_1_24; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_6=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L55] COND FALSE !(last_1_var_1_30 || stepLocal_6) [L66] var_1_26 = var_1_20 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L68] COND TRUE (var_1_6 * (var_1_8 * var_1_7)) > (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) - var_1_14) [L69] var_1_13 = (128u + var_1_26) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L73] unsigned short int stepLocal_0 = var_1_26; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_0=2, var_1_10=507/8, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L74] COND TRUE (-32 * (var_1_13 / var_1_3)) >= stepLocal_0 [L75] var_1_1 = ((((var_1_3 + var_1_13) < 0 ) ? -(var_1_3 + var_1_13) : (var_1_3 + var_1_13))) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L77] signed long int stepLocal_7 = - 1000; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_7=-1000, var_1_10=507/8, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-32, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L78] COND TRUE stepLocal_7 <= (var_1_21 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) [L79] var_1_28 = (var_1_29 + var_1_1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L83] signed long int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_1=132, var_1_10=507/8, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_5=53/20] [L84] COND TRUE stepLocal_1 >= 32 [L85] var_1_5 = (var_1_6 - ((var_1_7 + var_1_8) + var_1_9)) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2] [L89] COND TRUE var_1_3 != (var_1_1 / ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) [L90] var_1_10 = (var_1_9 - ((((((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) < (var_1_7)) ? (((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2] [L94] signed long int stepLocal_2 = var_1_26 % (var_1_20 + var_1_21); VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_2=2, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2] [L95] COND FALSE !(stepLocal_2 <= (~ ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) [L98] var_1_19 = (! var_1_22) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2] [L100] signed char stepLocal_5 = var_1_11; [L101] unsigned short int stepLocal_4 = var_1_26; [L102] unsigned char stepLocal_3 = var_1_20; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, stepLocal_4=2, stepLocal_5=-43, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2] [L103] COND TRUE stepLocal_4 >= var_1_20 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, stepLocal_5=-43, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2] [L104] COND FALSE !(stepLocal_5 > var_1_26) [L113] var_1_25 = var_1_8 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_8=2] [L116] signed long int stepLocal_8 = (0 ^ var_1_1) + var_1_29; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, stepLocal_8=-45, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=0, var_1_31=1, var_1_3=2, var_1_8=2] [L117] COND TRUE stepLocal_8 < var_1_11 [L118] var_1_30 = (var_1_22 && (var_1_19 || var_1_31)) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=1, var_1_31=1, var_1_3=2, var_1_8=2] [L122] COND FALSE !(var_1_25 >= var_1_9) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=1, var_1_31=1, var_1_3=2, var_1_8=2] [L127] COND FALSE !((var_1_5 != var_1_12) && var_1_30) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=2, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=1, var_1_31=1, var_1_3=2, var_1_8=2] [L198] RET step() [L199] CALL, EXPR property() [L188-L189] return ((((((((((((-32 * (var_1_13 / var_1_3)) >= var_1_26) ? (var_1_1 == ((signed long int) ((((var_1_3 + var_1_13) < 0 ) ? -(var_1_3 + var_1_13) : (var_1_3 + var_1_13))))) : 1) && ((var_1_1 >= 32) ? (var_1_5 == ((double) (var_1_6 - ((var_1_7 + var_1_8) + var_1_9)))) : (var_1_5 == ((double) 0.8)))) && ((var_1_3 != (var_1_1 / ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10 == ((double) (var_1_9 - ((((((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) < (var_1_7)) ? (((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) : (var_1_7)))))) : (var_1_10 == ((double) ((((var_1_6) > (var_1_8)) ? (var_1_6) : (var_1_8))))))) && (((var_1_6 * (var_1_8 * var_1_7)) > (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) - var_1_14)) ? (var_1_13 == ((unsigned long int) (128u + var_1_26))) : (var_1_13 == ((unsigned long int) var_1_26)))) && ((var_1_25 >= var_1_9) ? ((var_1_9 < var_1_14) ? (var_1_16 == ((float) var_1_8)) : 1) : 1)) && (((var_1_5 != var_1_12) && var_1_30) ? ((var_1_12 >= (var_1_9 * var_1_7)) ? ((var_1_11 >= var_1_26) ? (var_1_17 == ((double) var_1_12)) : (var_1_17 == ((double) var_1_7))) : (var_1_17 == ((double) var_1_6))) : 1)) && (((var_1_26 % (var_1_20 + var_1_21)) <= (~ ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) ? (var_1_19 == ((unsigned char) (((! var_1_22) || var_1_23) || var_1_24))) : (var_1_19 == ((unsigned char) (! var_1_22))))) && ((var_1_26 >= var_1_20) ? ((var_1_11 > var_1_26) ? (((((((10) > (var_1_3)) ? (10) : (var_1_3))) + var_1_28) >= var_1_20) ? ((! var_1_19) ? (var_1_25 == ((double) (var_1_9 - var_1_8))) : 1) : (var_1_25 == ((double) var_1_9))) : (var_1_25 == ((double) var_1_8))) : 1)) && ((last_1_var_1_30 || var_1_24) ? (last_1_var_1_19 ? (var_1_26 == ((unsigned short int) ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) : ((var_1_12 == last_1_var_1_16) ? (var_1_23 ? (var_1_26 == ((unsigned short int) var_1_20)) : 1) : 1)) : (var_1_26 == ((unsigned short int) var_1_20)))) && (((- 1000) <= (var_1_21 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (var_1_28 == ((signed short int) (var_1_29 + var_1_1))) : (var_1_28 == ((signed short int) -5)))) && ((((0 ^ var_1_1) + var_1_29) < var_1_11) ? (var_1_30 == ((unsigned char) (var_1_22 && (var_1_19 || var_1_31)))) : (var_1_30 == ((unsigned char) var_1_22))) ; VAL [\result=0, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=1, var_1_31=1, var_1_3=2, var_1_8=2] [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=1, var_1_31=1, var_1_3=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-43, var_1_13=130, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=132, var_1_20=2, var_1_21=2, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_28=-45, var_1_29=-177, var_1_30=1, var_1_31=1, var_1_3=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.2s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 40.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 449 mSDsluCounter, 1365 SdHoareTripleChecker+Invalid, 32.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 772 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 593 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 4 MinimizatonAttempts, 98 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 1372 NumberOfCodeBlocks, 1372 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1022 ConstructedInterpolants, 1 QuantifiedInterpolants, 2232 SizeOfPredicates, 4 NumberOfNonLiveVariables, 801 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 7684/7800 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-03 22:47:51,594 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-03 22:47:51,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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_100-1loop_file-49.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 da9b723eb6764db01c7e9bf3efd61044ec19f10f8fa82b3808d599b247834486 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:47:53,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:47:53,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:47:53,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:47:53,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:47:53,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:47:53,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:47:53,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:47:53,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:47:53,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:47:53,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:47:53,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:47:53,403 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:47:53,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:47:53,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:47:53,404 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:47:53,406 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:47:53,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:47:53,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:47:53,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:47:53,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:47:53,406 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 -> da9b723eb6764db01c7e9bf3efd61044ec19f10f8fa82b3808d599b247834486 [2025-03-03 22:47:53,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:47:53,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:47:53,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:47:53,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:47:53,664 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:47:53,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-03-03 22:47:54,849 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b66ea0e6/c05466d924044cc4826207467910154b/FLAGde9849578 [2025-03-03 22:47:55,074 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:47:55,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-03-03 22:47:55,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b66ea0e6/c05466d924044cc4826207467910154b/FLAGde9849578 [2025-03-03 22:47:55,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b66ea0e6/c05466d924044cc4826207467910154b [2025-03-03 22:47:55,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:47:55,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:47:55,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:47:55,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:47:55,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:47:55,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e291be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55, skipping insertion in model container [2025-03-03 22:47:55,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:47:55,568 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_100-1loop_file-49.i[916,929] [2025-03-03 22:47:55,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:47:55,633 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:47:55,643 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_100-1loop_file-49.i[916,929] [2025-03-03 22:47:55,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:47:55,711 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:47:55,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55 WrapperNode [2025-03-03 22:47:55,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:47:55,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:47:55,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:47:55,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:47:55,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,764 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-03-03 22:47:55,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:47:55,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:47:55,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:47:55,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:47:55,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,803 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-03 22:47:55,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:47:55,827 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:47:55,827 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:47:55,827 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:47:55,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (1/1) ... [2025-03-03 22:47:55,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:47:55,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:47:55,857 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-03 22:47:55,860 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-03 22:47:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:47:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:47:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:47:55,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:47:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:47:55,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:47:55,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:47:55,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:48:17,821 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-03 22:48:17,822 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:48:17,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:48:17,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:48:17,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:48:17 BoogieIcfgContainer [2025-03-03 22:48:17,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:48:17,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:48:17,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:48:17,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:48:17,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:47:55" (1/3) ... [2025-03-03 22:48:17,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3963f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:48:17, skipping insertion in model container [2025-03-03 22:48:17,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:55" (2/3) ... [2025-03-03 22:48:17,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3963f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:48:17, skipping insertion in model container [2025-03-03 22:48:17,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:48:17" (3/3) ... [2025-03-03 22:48:17,838 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-03-03 22:48:17,847 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:48:17,848 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-49.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:48:17,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:48:17,893 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;@6b4297a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:48:17,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:48:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:48:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 22:48:17,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:48:17,905 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:48:17,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:48:17,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:48:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash -169906250, now seen corresponding path program 1 times [2025-03-03 22:48:17,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:48:17,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003533259] [2025-03-03 22:48:17,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:48:17,916 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-03 22:48:17,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:48:17,918 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-03 22:48:17,928 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-03 22:48:18,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:48:18,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:48:18,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:48:18,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:48:18,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:48:18,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:48:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-03-03 22:48:18,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:48:18,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:48:18,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003533259] [2025-03-03 22:48:18,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003533259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:48:18,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:48:18,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:48:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953878955] [2025-03-03 22:48:18,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:48:18,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:48:18,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:48:19,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:48:19,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:48:19,005 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 22:48:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:48:19,029 INFO L93 Difference]: Finished difference Result 167 states and 287 transitions. [2025-03-03 22:48:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:48:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-03-03 22:48:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:48:19,035 INFO L225 Difference]: With dead ends: 167 [2025-03-03 22:48:19,035 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 22:48:19,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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-03 22:48:19,038 INFO L435 NwaCegarLoop]: 130 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, 130 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-03 22:48:19,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:48:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 22:48:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 22:48:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:48:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2025-03-03 22:48:19,064 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 171 [2025-03-03 22:48:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:48:19,064 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2025-03-03 22:48:19,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 22:48:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2025-03-03 22:48:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 22:48:19,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:48:19,067 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:48:19,100 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-03 22:48:19,267 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-03 22:48:19,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:48:19,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:48:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash -36591154, now seen corresponding path program 1 times [2025-03-03 22:48:19,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:48:19,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54435207] [2025-03-03 22:48:19,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:48:19,269 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-03 22:48:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:48:19,271 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-03 22:48:19,272 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-03 22:48:19,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:48:20,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:48:20,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:48:20,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:48:20,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 22:48:20,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:48:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 688 proven. 72 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-03 22:48:27,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:48:29,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 22:48:29,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:48:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54435207] [2025-03-03 22:48:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54435207] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 22:48:29,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:48:29,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 22:48:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065794612] [2025-03-03 22:48:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:48:29,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:48:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:48:29,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:48:29,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:48:29,625 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 22:48:34,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []