./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 905ea402cc55bdef24afb6746a861e91183650285de09f36be5802e4884371ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:45:41,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:45:41,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:45:41,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:45:41,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:45:41,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:45:41,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:45:41,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:45:41,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:45:41,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:45:41,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:45:41,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:45:41,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:45:41,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:45:41,536 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:45:41,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:45:41,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:45:41,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:45:41,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:45:41,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:45:41,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:45:41,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:45:41,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:45:41,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:45:41,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:45:41,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:45:41,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:45:41,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:45:41,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:45:41,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:45:41,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:45:41,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:45:41,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:45:41,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:45:41,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:45:41,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:45:41,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:45:41,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:45:41,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:45:41,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:45:41,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:45:41,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:45:41,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:45:41,539 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-jdk21/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 -> 905ea402cc55bdef24afb6746a861e91183650285de09f36be5802e4884371ad [2025-02-05 20:45:41,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:45:41,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:45:41,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:45:41,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:45:41,808 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:45:41,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i [2025-02-05 20:45:43,021 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/964cc6938/c5d2e9338f95436d9f04bfc642d4a547/FLAG088911d56 [2025-02-05 20:45:43,315 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:45:43,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i [2025-02-05 20:45:43,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/964cc6938/c5d2e9338f95436d9f04bfc642d4a547/FLAG088911d56 [2025-02-05 20:45:43,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/964cc6938/c5d2e9338f95436d9f04bfc642d4a547 [2025-02-05 20:45:43,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:45:43,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:45:43,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:45:43,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:45:43,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:45:43,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413dff3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43, skipping insertion in model container [2025-02-05 20:45:43,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:45:43,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i[917,930] [2025-02-05 20:45:43,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:45:43,749 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:45:43,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i[917,930] [2025-02-05 20:45:43,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:45:43,784 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:45:43,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43 WrapperNode [2025-02-05 20:45:43,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:45:43,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:45:43,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:45:43,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:45:43,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,817 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-02-05 20:45:43,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:45:43,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:45:43,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:45:43,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:45:43,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,837 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-02-05 20:45:43,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:45:43,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:45:43,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:45:43,851 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:45:43,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (1/1) ... [2025-02-05 20:45:43,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:45:43,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:45:43,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:45:43,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:45:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:45:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:45:43,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:45:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:45:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:45:43,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:45:43,952 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:45:43,953 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:45:44,224 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-05 20:45:44,224 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:45:44,234 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:45:44,234 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:45:44,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:45:44 BoogieIcfgContainer [2025-02-05 20:45:44,234 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:45:44,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:45:44,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:45:44,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:45:44,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:45:43" (1/3) ... [2025-02-05 20:45:44,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47aceeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:45:44, skipping insertion in model container [2025-02-05 20:45:44,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:43" (2/3) ... [2025-02-05 20:45:44,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47aceeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:45:44, skipping insertion in model container [2025-02-05 20:45:44,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:45:44" (3/3) ... [2025-02-05 20:45:44,243 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-32.i [2025-02-05 20:45:44,253 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:45:44,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-32.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:45:44,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:45:44,300 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;@4ab26c7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:45:44,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:45:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 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-02-05 20:45:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:45:44,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:45:44,312 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] [2025-02-05 20:45:44,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:45:44,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:45:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash -189127899, now seen corresponding path program 1 times [2025-02-05 20:45:44,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:45:44,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134270258] [2025-02-05 20:45:44,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:45:44,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:45:44,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:45:44,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:45:44,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:45:44,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:45:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 20:45:44,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:45:44,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134270258] [2025-02-05 20:45:44,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134270258] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:45:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722998602] [2025-02-05 20:45:44,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:45:44,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:45:44,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:45:44,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:45:44,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:45:44,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:45:44,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:45:44,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:45:44,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:45:44,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:45:44,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:45:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 20:45:44,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:45:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722998602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:45:44,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:45:44,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:45:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700410198] [2025-02-05 20:45:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:45:44,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:45:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:45:44,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:45:44,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:45:44,743 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-02-05 20:45:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:45:44,767 INFO L93 Difference]: Finished difference Result 138 states and 241 transitions. [2025-02-05 20:45:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:45:44,770 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 162 [2025-02-05 20:45:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:45:44,775 INFO L225 Difference]: With dead ends: 138 [2025-02-05 20:45:44,775 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 20:45:44,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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-02-05 20:45:44,783 INFO L435 NwaCegarLoop]: 105 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, 105 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-02-05 20:45:44,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:45:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 20:45:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-05 20:45:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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-02-05 20:45:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2025-02-05 20:45:44,811 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 162 [2025-02-05 20:45:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:45:44,812 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2025-02-05 20:45:44,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-02-05 20:45:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2025-02-05 20:45:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:45:44,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:45:44,815 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] [2025-02-05 20:45:44,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:45:45,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:45:45,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:45:45,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:45:45,021 INFO L85 PathProgramCache]: Analyzing trace with hash 958743753, now seen corresponding path program 1 times [2025-02-05 20:45:45,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:45:45,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183225423] [2025-02-05 20:45:45,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:45:45,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:45:45,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:45:45,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:45:45,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:45:45,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:45:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:45:45,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:45:45,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183225423] [2025-02-05 20:45:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183225423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:45:45,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:45:45,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:45:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290289831] [2025-02-05 20:45:45,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:45:45,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:45:45,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:45:45,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:45:45,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:45:45,375 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-05 20:45:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:45:45,429 INFO L93 Difference]: Finished difference Result 165 states and 249 transitions. [2025-02-05 20:45:45,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:45:45,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 162 [2025-02-05 20:45:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:45:45,431 INFO L225 Difference]: With dead ends: 165 [2025-02-05 20:45:45,431 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 20:45:45,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:45:45,432 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 43 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:45:45,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 216 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:45:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 20:45:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-02-05 20:45:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 62 states have internal predecessors, (80), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:45:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2025-02-05 20:45:45,455 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 162 [2025-02-05 20:45:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:45:45,456 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2025-02-05 20:45:45,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-05 20:45:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2025-02-05 20:45:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:45:45,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:45:45,460 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] [2025-02-05 20:45:45,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:45:45,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:45:45,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:45:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash -838207606, now seen corresponding path program 1 times [2025-02-05 20:45:45,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:45:45,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867453331] [2025-02-05 20:45:45,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:45:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:45:45,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:45:45,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:45:45,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:45:45,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:45:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-05 20:45:45,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:45:45,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867453331] [2025-02-05 20:45:45,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867453331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:45:45,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099351205] [2025-02-05 20:45:45,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:45:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:45:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:45:45,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:45:45,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:45:45,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:45:45,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:45:45,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:45:45,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:45:45,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 20:45:45,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:45:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2025-02-05 20:45:45,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:45:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-05 20:45:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099351205] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:45:46,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:45:46,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 20:45:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638224562] [2025-02-05 20:45:46,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:45:46,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:45:46,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:45:46,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:45:46,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:45:46,184 INFO L87 Difference]: Start difference. First operand 96 states and 144 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 20:45:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:45:46,506 INFO L93 Difference]: Finished difference Result 234 states and 350 transitions. [2025-02-05 20:45:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:45:46,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 162 [2025-02-05 20:45:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:45:46,509 INFO L225 Difference]: With dead ends: 234 [2025-02-05 20:45:46,509 INFO L226 Difference]: Without dead ends: 141 [2025-02-05 20:45:46,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:45:46,510 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 59 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:45:46,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 296 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:45:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-05 20:45:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 134. [2025-02-05 20:45:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 53 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 20:45:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2025-02-05 20:45:46,534 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 162 [2025-02-05 20:45:46,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:45:46,534 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2025-02-05 20:45:46,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 20:45:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2025-02-05 20:45:46,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:45:46,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:45:46,538 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] [2025-02-05 20:45:46,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:45:46,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:45:46,739 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:45:46,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:45:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash 734682911, now seen corresponding path program 1 times [2025-02-05 20:45:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:45:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294951403] [2025-02-05 20:45:46,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:45:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:45:46,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:45:46,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:45:46,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:45:46,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:45:46,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:45:46,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:45:46,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:45:46,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:45:46,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:45:46,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:45:46,979 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:45:46,980 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:45:46,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:45:46,983 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-05 20:45:47,063 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:45:47,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:45:47 BoogieIcfgContainer [2025-02-05 20:45:47,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:45:47,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:45:47,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:45:47,066 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:45:47,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:45:44" (3/4) ... [2025-02-05 20:45:47,068 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:45:47,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:45:47,069 INFO L158 Benchmark]: Toolchain (without parser) took 3466.47ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 139.0MB in the end (delta: 15.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2025-02-05 20:45:47,069 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:45:47,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.99ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 140.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:45:47,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.79ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 137.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:45:47,070 INFO L158 Benchmark]: Boogie Preprocessor took 31.28ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 132.4MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:45:47,070 INFO L158 Benchmark]: IcfgBuilder took 383.97ms. Allocated memory is still 201.3MB. Free memory was 132.4MB in the beginning and 110.9MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:45:47,070 INFO L158 Benchmark]: TraceAbstraction took 2827.82ms. Allocated memory is still 201.3MB. Free memory was 110.4MB in the beginning and 139.0MB in the end (delta: -28.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-02-05 20:45:47,071 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 201.3MB. Free memory was 139.0MB in the beginning and 139.0MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:45:47,072 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.23ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.99ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 140.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.79ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 137.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.28ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 132.4MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 383.97ms. Allocated memory is still 201.3MB. Free memory was 132.4MB in the beginning and 110.9MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2827.82ms. Allocated memory is still 201.3MB. Free memory was 110.4MB in the beginning and 139.0MB in the end (delta: -28.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 201.3MB. Free memory was 139.0MB in the beginning and 139.0MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = -25; [L25] unsigned char var_1_4 = 100; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 64; [L28] unsigned char var_1_7 = 32; [L29] unsigned char var_1_8 = 32; [L30] float var_1_9 = 100.5; [L31] unsigned char var_1_10 = 4; [L32] float var_1_11 = 0.8; [L33] float var_1_12 = 2.5; [L34] signed short int var_1_13 = -32; [L35] float var_1_14 = 3.2; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 0; [L38] unsigned char var_1_17 = 0; [L39] float var_1_18 = 0.25; [L40] float var_1_19 = 100000000.25; [L41] signed char var_1_20 = 0; [L42] signed char var_1_21 = 10; [L43] double var_1_22 = 1000000.5; [L44] unsigned long int var_1_23 = 256; [L45] unsigned long int var_1_24 = 50; VAL [isInitial=0, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L94] var_1_2 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] var_1_3 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] var_1_4 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L103] var_1_5 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L104] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L105] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L105] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L106] var_1_6 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L107] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L108] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L108] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L109] var_1_7 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_8=32, var_1_9=201/2] [L110] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_8=32, var_1_9=201/2] [L111] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=32, var_1_9=201/2] [L111] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=32, var_1_9=201/2] [L112] var_1_8 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_9=201/2] [L113] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_9=201/2] [L114] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L115] var_1_10 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L116] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L117] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L117] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L118] var_1_11 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L119] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L120] var_1_12 = __VERIFIER_nondet_float() [L121] 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, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L121] 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, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L122] var_1_14 = __VERIFIER_nondet_float() [L123] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L123] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L124] var_1_16 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L125] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L126] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L126] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L127] var_1_17 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L128] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L129] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L129] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L130] var_1_19 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L131] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L132] var_1_21 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L133] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L134] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L134] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L147] RET updateVariables() [L148] CALL step() [L49] COND TRUE -32 < var_1_3 [L50] var_1_1 = (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=190, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=201/2] [L52] COND FALSE !((var_1_10 + ((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) == var_1_5) [L55] var_1_9 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=190, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] [L57] COND FALSE !((var_1_12 * ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11)))) > (- var_1_14)) VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=190, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] [L66] COND FALSE !(var_1_5 >= var_1_6) [L75] var_1_15 = var_1_17 VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=190, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] [L77] unsigned char stepLocal_1 = var_1_15; [L78] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=190, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] [L79] COND TRUE var_1_17 || stepLocal_1 VAL [isInitial=1, stepLocal_0=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=190, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] [L80] COND FALSE !(stepLocal_0 && var_1_2) [L83] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=190, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] [L86] COND TRUE var_1_11 == var_1_18 [L87] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=190, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] [L89] var_1_22 = var_1_12 [L90] var_1_23 = var_1_8 [L91] var_1_24 = var_1_6 VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=190, var_1_20=-1, var_1_21=-1, var_1_22=100000006, var_1_23=0, var_1_24=127, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] [L148] RET step() [L149] CALL, EXPR property() [L139-L140] return (((((((((-32 < var_1_3) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_10 + ((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11)))) > (- var_1_14)) ? ((var_1_6 <= var_1_8) ? (var_1_2 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((var_1_13 <= var_1_10) ? (var_1_15 == ((unsigned char) var_1_16)) : ((var_1_2 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_2) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=190, var_1_20=-1, var_1_21=-1, var_1_22=100000006, var_1_23=0, var_1_24=127, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=190, var_1_20=-1, var_1_21=-1, var_1_22=100000006, var_1_23=0, var_1_24=127, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_12=100000006, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=100000005, var_1_19=100000005, var_1_1=190, var_1_20=-1, var_1_21=-1, var_1_22=100000006, var_1_23=0, var_1_24=127, var_1_2=0, var_1_3=128, var_1_4=-81537, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=256, var_1_9=100000006] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 617 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 372 IncrementalHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 346 mSDtfsCounter, 372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 497 GetRequests, 486 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 973 NumberOfCodeBlocks, 973 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 1248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 733 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 7714/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-02-05 20:45:47,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 905ea402cc55bdef24afb6746a861e91183650285de09f36be5802e4884371ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:45:49,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:45:49,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:45:49,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:45:49,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:45:49,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:45:49,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:45:49,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:45:49,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:45:49,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:45:49,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:45:49,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:45:49,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:45:49,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:45:49,147 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:45:49,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:45:49,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:45:49,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:45:49,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:45:49,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:45:49,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:45:49,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:45:49,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:45:49,147 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:45:49,148 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:45:49,148 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:45:49,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:45:49,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:45:49,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:45:49,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:45:49,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:45:49,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:45:49,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:45:49,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:45:49,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:45:49,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:45:49,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:45:49,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:45:49,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:45:49,149 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:45:49,149 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:45:49,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:45:49,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:45:49,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:45:49,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:45:49,150 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-jdk21/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 -> 905ea402cc55bdef24afb6746a861e91183650285de09f36be5802e4884371ad [2025-02-05 20:45:49,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:45:49,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:45:49,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:45:49,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:45:49,422 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:45:49,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i [2025-02-05 20:45:50,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46da29f63/1741f474feb04852b52dddf2ca787faf/FLAG805fc2e82 [2025-02-05 20:45:50,881 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:45:50,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i [2025-02-05 20:45:50,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46da29f63/1741f474feb04852b52dddf2ca787faf/FLAG805fc2e82 [2025-02-05 20:45:51,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46da29f63/1741f474feb04852b52dddf2ca787faf [2025-02-05 20:45:51,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:45:51,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:45:51,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:45:51,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:45:51,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:45:51,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f770e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51, skipping insertion in model container [2025-02-05 20:45:51,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:45:51,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i[917,930] [2025-02-05 20:45:51,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:45:51,447 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:45:51,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i[917,930] [2025-02-05 20:45:51,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:45:51,482 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:45:51,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51 WrapperNode [2025-02-05 20:45:51,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:45:51,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:45:51,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:45:51,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:45:51,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,513 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2025-02-05 20:45:51,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:45:51,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:45:51,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:45:51,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:45:51,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,554 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-02-05 20:45:51,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:45:51,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:45:51,573 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:45:51,574 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:45:51,577 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (1/1) ... [2025-02-05 20:45:51,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:45:51,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:45:51,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:45:51,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:45:51,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:45:51,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:45:51,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:45:51,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:45:51,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:45:51,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:45:51,698 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:45:51,699 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:45:54,883 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-05 20:45:54,883 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:45:54,890 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:45:54,911 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:45:54,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:45:54 BoogieIcfgContainer [2025-02-05 20:45:54,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:45:54,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:45:54,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:45:54,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:45:54,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:45:51" (1/3) ... [2025-02-05 20:45:54,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd5b907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:45:54, skipping insertion in model container [2025-02-05 20:45:54,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:45:51" (2/3) ... [2025-02-05 20:45:54,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd5b907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:45:54, skipping insertion in model container [2025-02-05 20:45:54,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:45:54" (3/3) ... [2025-02-05 20:45:54,918 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-32.i [2025-02-05 20:45:54,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:45:54,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-32.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:45:54,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:45:54,968 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;@22c0c3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:45:54,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:45:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 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-02-05 20:45:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:45:54,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:45:54,979 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] [2025-02-05 20:45:54,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:45:54,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:45:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash -189127899, now seen corresponding path program 1 times [2025-02-05 20:45:54,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:45:54,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740226351] [2025-02-05 20:45:54,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:45:54,994 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-02-05 20:45:54,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:45:54,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 20:45:54,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:45:55,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:45:55,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:45:55,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:45:55,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:45:55,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:45:55,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:45:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-02-05 20:45:55,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:45:55,296 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:45:55,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740226351] [2025-02-05 20:45:55,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740226351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:45:55,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:45:55,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:45:55,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921419199] [2025-02-05 20:45:55,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:45:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:45:55,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:45:55,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:45:55,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:45:55,314 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-02-05 20:45:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:45:55,331 INFO L93 Difference]: Finished difference Result 138 states and 241 transitions. [2025-02-05 20:45:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:45:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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 162 [2025-02-05 20:45:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:45:55,337 INFO L225 Difference]: With dead ends: 138 [2025-02-05 20:45:55,338 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 20:45:55,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-02-05 20:45:55,342 INFO L435 NwaCegarLoop]: 105 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, 105 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-02-05 20:45:55,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:45:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 20:45:55,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-05 20:45:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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-02-05 20:45:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2025-02-05 20:45:55,369 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 162 [2025-02-05 20:45:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:45:55,369 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2025-02-05 20:45:55,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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-02-05 20:45:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2025-02-05 20:45:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:45:55,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:45:55,371 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] [2025-02-05 20:45:55,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:45:55,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 20:45:55,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:45:55,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:45:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash 958743753, now seen corresponding path program 1 times [2025-02-05 20:45:55,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:45:55,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329691219] [2025-02-05 20:45:55,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:45:55,578 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-02-05 20:45:55,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:45:55,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 20:45:55,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:45:55,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:45:55,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:45:55,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:45:55,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:45:55,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 20:45:55,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:45:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2025-02-05 20:45:56,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:45:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-02-05 20:45:56,359 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:45:56,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329691219] [2025-02-05 20:45:56,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329691219] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:45:56,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:45:56,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-05 20:45:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051782353] [2025-02-05 20:45:56,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:45:56,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:45:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:45:56,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:45:56,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:45:56,363 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 20:45:59,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:45:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:45:59,382 INFO L93 Difference]: Finished difference Result 178 states and 270 transitions. [2025-02-05 20:45:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:45:59,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 162 [2025-02-05 20:45:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:45:59,384 INFO L225 Difference]: With dead ends: 178 [2025-02-05 20:45:59,384 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 20:45:59,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:45:59,385 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 59 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:45:59,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 296 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 20:45:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 20:45:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2025-02-05 20:45:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 58 states have internal predecessors, (68), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-05 20:45:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2025-02-05 20:45:59,398 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 162 [2025-02-05 20:45:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:45:59,399 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2025-02-05 20:45:59,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 20:45:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2025-02-05 20:45:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:45:59,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:45:59,400 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] [2025-02-05 20:45:59,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 20:45:59,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-05 20:45:59,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:45:59,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:45:59,603 INFO L85 PathProgramCache]: Analyzing trace with hash 605600192, now seen corresponding path program 1 times [2025-02-05 20:45:59,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:45:59,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801457519] [2025-02-05 20:45:59,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:45:59,603 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-02-05 20:45:59,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:45:59,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-05 20:45:59,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 20:45:59,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:45:59,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:45:59,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:45:59,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:45:59,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 20:45:59,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:46:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 144 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2025-02-05 20:46:00,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:46:01,096 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:46:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801457519] [2025-02-05 20:46:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801457519] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:46:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [671773112] [2025-02-05 20:46:01,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:46:01,097 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 20:46:01,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 20:46:01,099 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 20:46:01,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-02-05 20:46:01,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:46:02,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:46:02,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:46:02,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:46:02,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 20:46:02,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:46:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 144 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2025-02-05 20:46:02,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:46:02,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [671773112] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:46:02,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:46:02,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2025-02-05 20:46:02,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359050411] [2025-02-05 20:46:02,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:46:02,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:46:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:46:02,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:46:02,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:46:02,730 INFO L87 Difference]: Start difference. First operand 107 states and 162 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-05 20:46:04,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:46:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:46:04,367 INFO L93 Difference]: Finished difference Result 207 states and 288 transitions. [2025-02-05 20:46:04,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 20:46:04,384 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 163 [2025-02-05 20:46:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:46:04,387 INFO L225 Difference]: With dead ends: 207 [2025-02-05 20:46:04,387 INFO L226 Difference]: Without dead ends: 137 [2025-02-05 20:46:04,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:46:04,395 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 93 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:46:04,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 167 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 20:46:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-05 20:46:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2025-02-05 20:46:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 73 states have (on average 1.095890410958904) internal successors, (80), 74 states have internal predecessors, (80), 47 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-05 20:46:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 174 transitions. [2025-02-05 20:46:04,423 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 174 transitions. Word has length 163 [2025-02-05 20:46:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:46:04,424 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 174 transitions. [2025-02-05 20:46:04,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-05 20:46:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 174 transitions. [2025-02-05 20:46:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:46:04,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:46:04,427 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] [2025-02-05 20:46:04,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 20:46:04,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2025-02-05 20:46:04,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 20:46:04,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:46:04,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:46:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 734682911, now seen corresponding path program 1 times [2025-02-05 20:46:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:46:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344930556] [2025-02-05 20:46:04,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:46:04,833 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-02-05 20:46:04,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:46:04,836 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-02-05 20:46:04,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Waiting until timeout for monitored process [2025-02-05 20:46:04,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:46:05,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:46:05,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:46:05,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:46:05,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 20:46:05,205 INFO L279 TraceCheckSpWp]: Computing forward predicates...