./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_floatingpointinfluence_no-floats_file-81.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 fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:46:38,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:46:38,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:46:38,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:46:38,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:46:39,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:46:39,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:46:39,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:46:39,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:46:39,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:46:39,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:46:39,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:46:39,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:46:39,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:46:39,011 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:46:39,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:46:39,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:46:39,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:46:39,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:46:39,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:46:39,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:46:39,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:46:39,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:46:39,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:46:39,013 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:46:39,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:46:39,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:46:39,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:46:39,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:46:39,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:39,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:39,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:39,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:39,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:46:39,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:39,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:39,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:39,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:39,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:46:39,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:46:39,015 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:46:39,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:46:39,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:46:39,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:46:39,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:46:39,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:46:39,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:46:39,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:46:39,017 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 -> fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f [2025-01-09 12:46:39,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:46:39,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:46:39,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:46:39,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:46:39,311 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:46:39,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2025-01-09 12:46:40,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46db495e6/14ae347fdafc492d97bc9e7ea0b9ff78/FLAG93d53a7fd [2025-01-09 12:46:40,906 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:46:40,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2025-01-09 12:46:40,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46db495e6/14ae347fdafc492d97bc9e7ea0b9ff78/FLAG93d53a7fd [2025-01-09 12:46:41,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46db495e6/14ae347fdafc492d97bc9e7ea0b9ff78 [2025-01-09 12:46:41,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:46:41,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:46:41,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:41,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:46:41,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:46:41,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609d2389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41, skipping insertion in model container [2025-01-09 12:46:41,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:46:41,325 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2025-01-09 12:46:41,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:41,364 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:46:41,377 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2025-01-09 12:46:41,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:41,427 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:46:41,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41 WrapperNode [2025-01-09 12:46:41,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:41,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:41,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:46:41,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:46:41,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,475 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-01-09 12:46:41,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:41,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:46:41,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:46:41,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:46:41,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,501 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-01-09 12:46:41,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:46:41,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:46:41,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:46:41,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:46:41,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (1/1) ... [2025-01-09 12:46:41,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:41,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:41,552 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-01-09 12:46:41,558 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-01-09 12:46:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:46:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:46:41,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:46:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:46:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:46:41,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:46:41,642 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:46:41,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:46:41,957 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 12:46:41,957 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:46:41,970 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:46:41,972 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:46:41,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:41 BoogieIcfgContainer [2025-01-09 12:46:41,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:46:41,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:46:41,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:46:41,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:46:41,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:46:41" (1/3) ... [2025-01-09 12:46:41,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb3168a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:41, skipping insertion in model container [2025-01-09 12:46:41,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:41" (2/3) ... [2025-01-09 12:46:41,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb3168a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:41, skipping insertion in model container [2025-01-09 12:46:41,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:41" (3/3) ... [2025-01-09 12:46:41,983 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2025-01-09 12:46:41,993 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:46:41,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-81.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:46:42,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:46:42,053 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;@137bd973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:46:42,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:46:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 12:46:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:46:42,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:42,068 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:46:42,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:42,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1916834142, now seen corresponding path program 1 times [2025-01-09 12:46:42,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:42,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62686087] [2025-01-09 12:46:42,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:42,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:46:42,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:46:42,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:42,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 12:46:42,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:42,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62686087] [2025-01-09 12:46:42,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62686087] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:46:42,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568344260] [2025-01-09 12:46:42,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:42,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:42,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:42,387 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-01-09 12:46:42,390 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-01-09 12:46:42,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:46:42,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:46:42,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:42,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:42,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:46:42,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 12:46:42,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:42,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568344260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:42,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:46:42,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:46:42,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940942953] [2025-01-09 12:46:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:42,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:46:42,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:42,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:46:42,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:46:42,646 INFO L87 Difference]: Start difference. First operand has 70 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 12:46:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:42,674 INFO L93 Difference]: Finished difference Result 134 states and 229 transitions. [2025-01-09 12:46:42,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:46:42,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2025-01-09 12:46:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:42,684 INFO L225 Difference]: With dead ends: 134 [2025-01-09 12:46:42,684 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 12:46:42,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-01-09 12:46:42,689 INFO L435 NwaCegarLoop]: 101 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, 101 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-01-09 12:46:42,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 12:46:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 12:46:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 12:46:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-01-09 12:46:42,726 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 139 [2025-01-09 12:46:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:42,726 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-01-09 12:46:42,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 12:46:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-01-09 12:46:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:46:42,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:42,729 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:46:42,736 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-01-09 12:46:42,930 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-01-09 12:46:42,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:42,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash 344009374, now seen corresponding path program 1 times [2025-01-09 12:46:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791724676] [2025-01-09 12:46:42,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:42,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:42,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:46:43,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:46:43,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:43,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:46:43,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:43,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791724676] [2025-01-09 12:46:43,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791724676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:43,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:43,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:46:43,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577455940] [2025-01-09 12:46:43,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:43,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:46:43,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:43,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:46:43,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:46:43,259 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:43,491 INFO L93 Difference]: Finished difference Result 196 states and 298 transitions. [2025-01-09 12:46:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:46:43,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2025-01-09 12:46:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:43,494 INFO L225 Difference]: With dead ends: 196 [2025-01-09 12:46:43,496 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 12:46:43,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:46:43,498 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 69 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:43,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 261 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:46:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 12:46:43,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2025-01-09 12:46:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 12:46:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 187 transitions. [2025-01-09 12:46:43,531 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 187 transitions. Word has length 139 [2025-01-09 12:46:43,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:43,531 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 187 transitions. [2025-01-09 12:46:43,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 187 transitions. [2025-01-09 12:46:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:46:43,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:43,534 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:46:43,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:46:43,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:43,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash 75568190, now seen corresponding path program 1 times [2025-01-09 12:46:43,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:43,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235999186] [2025-01-09 12:46:43,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:43,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:43,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:46:43,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:46:43,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:43,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:46:44,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:44,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235999186] [2025-01-09 12:46:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235999186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:44,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:46:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945102842] [2025-01-09 12:46:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:44,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:46:44,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:44,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:46:44,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:46:44,950 INFO L87 Difference]: Start difference. First operand 123 states and 187 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:45,083 INFO L93 Difference]: Finished difference Result 207 states and 311 transitions. [2025-01-09 12:46:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:46:45,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2025-01-09 12:46:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:45,089 INFO L225 Difference]: With dead ends: 207 [2025-01-09 12:46:45,089 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 12:46:45,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:46:45,090 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 17 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:45,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 482 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:46:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 12:46:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2025-01-09 12:46:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 12:46:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 191 transitions. [2025-01-09 12:46:45,120 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 191 transitions. Word has length 140 [2025-01-09 12:46:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:45,120 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 191 transitions. [2025-01-09 12:46:45,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 191 transitions. [2025-01-09 12:46:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:46:45,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:45,122 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:46:45,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:46:45,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:45,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1850575552, now seen corresponding path program 1 times [2025-01-09 12:46:45,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:45,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95266448] [2025-01-09 12:46:45,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:45,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:46:45,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:46:45,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:45,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:46:45,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:45,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95266448] [2025-01-09 12:46:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95266448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:45,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:45,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:46:45,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560733699] [2025-01-09 12:46:45,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:45,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:46:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:45,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:46:45,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:46:45,374 INFO L87 Difference]: Start difference. First operand 127 states and 191 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:45,432 INFO L93 Difference]: Finished difference Result 226 states and 337 transitions. [2025-01-09 12:46:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:46:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2025-01-09 12:46:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:45,436 INFO L225 Difference]: With dead ends: 226 [2025-01-09 12:46:45,438 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 12:46:45,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:46:45,439 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 25 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:45,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 445 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 12:46:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2025-01-09 12:46:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 12:46:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2025-01-09 12:46:45,461 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 203 transitions. Word has length 140 [2025-01-09 12:46:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:45,463 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 203 transitions. [2025-01-09 12:46:45,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 203 transitions. [2025-01-09 12:46:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 12:46:45,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:45,465 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:46:45,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:46:45,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:45,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1818463028, now seen corresponding path program 1 times [2025-01-09 12:46:45,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:45,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614591249] [2025-01-09 12:46:45,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:45,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 12:46:45,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 12:46:45,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:45,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:46:45,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614591249] [2025-01-09 12:46:45,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614591249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:45,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:45,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:46:45,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626823953] [2025-01-09 12:46:45,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:45,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:46:45,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:45,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:46:45,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:46:45,663 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:45,817 INFO L93 Difference]: Finished difference Result 233 states and 347 transitions. [2025-01-09 12:46:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:46:45,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-01-09 12:46:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:45,821 INFO L225 Difference]: With dead ends: 233 [2025-01-09 12:46:45,821 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 12:46:45,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:46:45,823 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 60 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:45,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 266 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:46:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 12:46:45,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2025-01-09 12:46:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 12:46:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2025-01-09 12:46:45,850 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 143 [2025-01-09 12:46:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:45,850 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2025-01-09 12:46:45,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2025-01-09 12:46:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 12:46:45,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:45,852 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:46:45,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:46:45,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:45,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:45,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1129478862, now seen corresponding path program 1 times [2025-01-09 12:46:45,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:45,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311381535] [2025-01-09 12:46:45,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:45,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:45,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 12:46:45,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 12:46:45,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:45,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:46:45,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:46:45,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 12:46:46,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 12:46:46,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:46,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:46:46,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:46:46,103 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:46:46,104 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:46:46,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:46:46,107 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 12:46:46,203 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:46:46,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:46:46 BoogieIcfgContainer [2025-01-09 12:46:46,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:46:46,209 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:46:46,209 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:46:46,210 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:46:46,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:41" (3/4) ... [2025-01-09 12:46:46,213 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:46:46,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:46:46,215 INFO L158 Benchmark]: Toolchain (without parser) took 5016.89ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 112.6MB in the beginning and 67.0MB in the end (delta: 45.6MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2025-01-09 12:46:46,216 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:46:46,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.44ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:46:46,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.14ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 96.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:46:46,217 INFO L158 Benchmark]: Boogie Preprocessor took 41.84ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 93.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:46:46,217 INFO L158 Benchmark]: RCFGBuilder took 453.96ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 73.9MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 12:46:46,217 INFO L158 Benchmark]: TraceAbstraction took 4234.00ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 73.0MB in the beginning and 67.0MB in the end (delta: 6.0MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2025-01-09 12:46:46,218 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 192.9MB. Free memory was 67.0MB in the beginning and 67.0MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:46:46,219 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.42ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.44ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.14ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 96.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.84ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 93.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 453.96ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 73.9MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4234.00ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 73.0MB in the beginning and 67.0MB in the end (delta: 6.0MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 192.9MB. Free memory was 67.0MB in the beginning and 67.0MB in the end (delta: 36.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 bitwiseOr at line 43, overapproximation of bitwiseOr at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 9999; [L23] unsigned char var_1_2 = 1; [L24] signed long int var_1_3 = 4; [L25] signed long int var_1_4 = 2; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 999999999; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = 16; [L30] signed char var_1_12 = 16; [L31] unsigned short int var_1_13 = 5; [L32] unsigned char var_1_14 = 1; [L33] unsigned short int var_1_15 = 16; [L34] unsigned short int var_1_16 = 32647; [L35] unsigned short int var_1_17 = 128; [L36] signed long int var_1_18 = -8; [L37] unsigned short int last_1_var_1_13 = 5; [L38] signed long int last_1_var_1_18 = -8; VAL [isInitial=0, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L114] isInitial = 1 [L115] FCALL initially() [L117] CALL updateLastVariables() [L106] last_1_var_1_13 = var_1_13 [L107] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L117] RET updateLastVariables() [L118] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L75] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L80] var_1_5 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_5 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L81] RET assume_abort_if_not(var_1_5 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L83] var_1_6 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L86] var_1_11 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L89] var_1_12 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L92] var_1_14 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L95] var_1_15 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L98] var_1_16 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L99] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L100] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L100] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L101] var_1_17 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L102] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L103] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L103] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L118] RET updateVariables() [L119] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18)); VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L43] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-128] [L43] COND FALSE !(stepLocal_0 != (last_1_var_1_18 ^ last_1_var_1_13)) [L48] var_1_7 = ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] [L50] unsigned char stepLocal_1 = var_1_11 >= var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_1=1, var_1_11=-62, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] [L51] COND TRUE stepLocal_1 && var_1_14 [L52] var_1_13 = ((((var_1_15) < (100)) ? (var_1_15) : (100))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] [L56] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_2=-63, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] [L57] COND FALSE !(stepLocal_2 > var_1_16) [L64] var_1_18 = var_1_15 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] [L66] COND TRUE \read(var_1_2) [L67] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=5, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] [L119] RET step() [L120] CALL, EXPR property() [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=5, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] [L110] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=5, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=5, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] [L110-L111] return (((var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))))))) && (((var_1_11 >= var_1_7) && var_1_14) ? (var_1_13 == ((unsigned short int) ((((var_1_15) < (100)) ? (var_1_15) : (100))))) : (var_1_13 == ((unsigned short int) ((var_1_16 - 5) + var_1_17))))) && ((var_1_7 > var_1_16) ? ((var_1_3 < (var_1_5 - var_1_6)) ? (var_1_18 == ((signed long int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) : (var_1_18 == ((signed long int) var_1_13))) : (var_1_18 == ((signed long int) var_1_15))) ; [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=5, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-62, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=5, var_1_2=1, var_1_3=4, var_1_4=9, var_1_5=2147483647, var_1_6=2147483643, var_1_7=-63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 1555 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1043 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 512 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=4, InterpolantAutomatonStates: 18, 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, 5 MinimizatonAttempts, 54 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 987 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 1327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 318 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 5502/5544 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-01-09 12:46:46,240 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_floatingpointinfluence_no-floats_file-81.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 fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:46:48,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:46:48,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:46:48,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:46:48,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:46:48,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:46:48,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:46:48,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:46:48,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:46:48,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:46:48,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:46:48,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:46:48,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:46:48,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:46:48,627 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:46:48,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:46:48,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:46:48,628 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:46:48,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:46:48,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:46:48,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:46:48,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:46:48,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:46:48,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:46:48,630 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:46:48,630 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:46:48,630 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:46:48,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:46:48,631 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:46:48,631 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:46:48,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:46:48,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:48,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:48,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:46:48,632 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:46:48,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:46:48,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:46:48,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:46:48,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:46:48,633 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 -> fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f [2025-01-09 12:46:48,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:46:48,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:46:48,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:46:48,925 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:46:48,925 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:46:48,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2025-01-09 12:46:50,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8aa57f81/38c282e7165c49f29a58911055f5eb0e/FLAG0aedf7763 [2025-01-09 12:46:50,386 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:46:50,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2025-01-09 12:46:50,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8aa57f81/38c282e7165c49f29a58911055f5eb0e/FLAG0aedf7763 [2025-01-09 12:46:50,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8aa57f81/38c282e7165c49f29a58911055f5eb0e [2025-01-09 12:46:50,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:46:50,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:46:50,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:50,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:46:50,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:46:50,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467efdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50, skipping insertion in model container [2025-01-09 12:46:50,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:46:50,577 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2025-01-09 12:46:50,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:50,651 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:46:50,663 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2025-01-09 12:46:50,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:50,708 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:46:50,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50 WrapperNode [2025-01-09 12:46:50,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:50,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:50,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:46:50,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:46:50,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,746 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-01-09 12:46:50,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:50,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:46:50,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:46:50,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:46:50,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,769 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-01-09 12:46:50,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:46:50,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:46:50,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:46:50,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:46:50,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (1/1) ... [2025-01-09 12:46:50,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:50,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:50,823 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-01-09 12:46:50,826 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-01-09 12:46:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:46:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:46:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:46:50,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:46:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:46:50,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:46:50,926 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:46:50,927 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:46:51,195 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:46:51,195 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:46:51,208 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:46:51,209 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:46:51,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:51 BoogieIcfgContainer [2025-01-09 12:46:51,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:46:51,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:46:51,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:46:51,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:46:51,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:46:50" (1/3) ... [2025-01-09 12:46:51,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6983f1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:51, skipping insertion in model container [2025-01-09 12:46:51,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:50" (2/3) ... [2025-01-09 12:46:51,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6983f1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:51, skipping insertion in model container [2025-01-09 12:46:51,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:51" (3/3) ... [2025-01-09 12:46:51,218 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2025-01-09 12:46:51,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:46:51,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-81.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:46:51,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:46:51,303 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;@108ec79d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:46:51,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:46:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 12:46:51,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 12:46:51,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:51,321 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:46:51,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1654112422, now seen corresponding path program 1 times [2025-01-09 12:46:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:46:51,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339901203] [2025-01-09 12:46:51,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:51,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:51,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:51,346 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-01-09 12:46:51,348 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-01-09 12:46:51,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 12:46:51,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 12:46:51,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:51,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:51,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:46:51,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 12:46:51,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:51,571 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:46:51,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339901203] [2025-01-09 12:46:51,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339901203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:51,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:51,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:46:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033293538] [2025-01-09 12:46:51,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:51,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:46:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:46:51,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:46:51,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:46:51,613 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 12:46:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:51,642 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2025-01-09 12:46:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:46:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2025-01-09 12:46:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:51,652 INFO L225 Difference]: With dead ends: 112 [2025-01-09 12:46:51,653 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 12:46:51,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-01-09 12:46:51,659 INFO L435 NwaCegarLoop]: 83 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, 83 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-01-09 12:46:51,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 12:46:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 12:46:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 12:46:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-01-09 12:46:51,708 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 136 [2025-01-09 12:46:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:51,709 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-01-09 12:46:51,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 12:46:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-01-09 12:46:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 12:46:51,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:51,713 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:46:51,722 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-01-09 12:46:51,914 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 [2025-01-09 12:46:51,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1350586522, now seen corresponding path program 1 times [2025-01-09 12:46:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:46:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17382707] [2025-01-09 12:46:51,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:51,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:51,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:51,920 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-01-09 12:46:51,923 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-01-09 12:46:51,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 12:46:52,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 12:46:52,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:52,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:52,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:46:52,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:46:53,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:53,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:46:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17382707] [2025-01-09 12:46:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17382707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:46:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519413385] [2025-01-09 12:46:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:53,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:46:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:46:53,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:46:53,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:46:53,009 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:53,251 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2025-01-09 12:46:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:46:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2025-01-09 12:46:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:53,254 INFO L225 Difference]: With dead ends: 163 [2025-01-09 12:46:53,254 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 12:46:53,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:46:53,256 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:53,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 260 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:46:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 12:46:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2025-01-09 12:46:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 12:46:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2025-01-09 12:46:53,289 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 136 [2025-01-09 12:46:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:53,290 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2025-01-09 12:46:53,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2025-01-09 12:46:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 12:46:53,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:53,294 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:46:53,304 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-01-09 12:46:53,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:53,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:53,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1052626062, now seen corresponding path program 1 times [2025-01-09 12:46:53,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:46:53,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1602917850] [2025-01-09 12:46:53,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:53,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:53,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:46:53,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 12:46:53,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 12:46:53,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 12:46:53,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:53,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:53,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:46:53,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:46:53,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:53,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:46:53,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602917850] [2025-01-09 12:46:53,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602917850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:53,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:53,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:46:53,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741632760] [2025-01-09 12:46:53,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:53,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:46:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:46:53,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:46:53,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:53,635 INFO L87 Difference]: Start difference. First operand 96 states and 144 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:53,680 INFO L93 Difference]: Finished difference Result 163 states and 242 transitions. [2025-01-09 12:46:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:46:53,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 137 [2025-01-09 12:46:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:53,684 INFO L225 Difference]: With dead ends: 163 [2025-01-09 12:46:53,684 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 12:46:53,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 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-01-09 12:46:53,685 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:53,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 153 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 12:46:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2025-01-09 12:46:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 12:46:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2025-01-09 12:46:53,723 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 137 [2025-01-09 12:46:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:53,723 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2025-01-09 12:46:53,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:46:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2025-01-09 12:46:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 12:46:53,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:53,728 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:46:53,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 12:46:53,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:53,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:53,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:53,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1050779020, now seen corresponding path program 1 times [2025-01-09 12:46:53,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:46:53,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087811806] [2025-01-09 12:46:53,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:53,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:53,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:53,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:46:53,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 12:46:53,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 12:46:54,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 12:46:54,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:54,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:54,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 12:46:54,029 INFO L279 TraceCheckSpWp]: Computing forward predicates...