./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c -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 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:07:31,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:07:31,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:07:31,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:07:31,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:07:31,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:07:31,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:07:31,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:07:31,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:07:31,632 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:07:31,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:07:31,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:07:31,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:07:31,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:07:31,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:07:31,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:07:31,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:07:31,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:07:31,634 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 -> 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 [2025-02-05 15:07:31,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:07:31,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:07:31,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:07:31,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:07:31,877 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:07:31,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2025-02-05 15:07:32,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5b8061d4/2bcee1ed10c340489dc598996cebb895/FLAG200acec86 [2025-02-05 15:07:33,203 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:07:33,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2025-02-05 15:07:33,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5b8061d4/2bcee1ed10c340489dc598996cebb895/FLAG200acec86 [2025-02-05 15:07:33,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5b8061d4/2bcee1ed10c340489dc598996cebb895 [2025-02-05 15:07:33,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:07:33,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:07:33,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:07:33,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:07:33,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:07:33,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2431ec39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33, skipping insertion in model container [2025-02-05 15:07:33,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:07:33,676 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/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2025-02-05 15:07:33,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:07:33,697 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:07:33,703 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/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2025-02-05 15:07:33,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:07:33,722 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:07:33,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33 WrapperNode [2025-02-05 15:07:33,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:07:33,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:07:33,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:07:33,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:07:33,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,747 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-02-05 15:07:33,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:07:33,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:07:33,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:07:33,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:07:33,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,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-02-05 15:07:33,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:07:33,775 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:07:33,775 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:07:33,775 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:07:33,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (1/1) ... [2025-02-05 15:07:33,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:07:33,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:33,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:07:33,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:07:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:07:33,843 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 15:07:33,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 15:07:33,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:07:33,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:07:33,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:07:33,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 15:07:33,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 15:07:33,893 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:07:33,895 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:07:34,012 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-05 15:07:34,012 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:07:34,018 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:07:34,018 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:07:34,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:07:34 BoogieIcfgContainer [2025-02-05 15:07:34,018 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:07:34,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:07:34,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:07:34,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:07:34,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:07:33" (1/3) ... [2025-02-05 15:07:34,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a961f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:07:34, skipping insertion in model container [2025-02-05 15:07:34,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:33" (2/3) ... [2025-02-05 15:07:34,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a961f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:07:34, skipping insertion in model container [2025-02-05 15:07:34,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:07:34" (3/3) ... [2025-02-05 15:07:34,024 INFO L128 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2025-02-05 15:07:34,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:07:34,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG egcd-ll_unwindbound50.c that has 3 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:07:34,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:07:34,099 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;@3c1be4f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:07:34,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:07:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:07:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 15:07:34,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:34,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:34,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:34,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:34,110 INFO L85 PathProgramCache]: Analyzing trace with hash 825598194, now seen corresponding path program 1 times [2025-02-05 15:07:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555556249] [2025-02-05 15:07:34,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:34,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:07:34,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:07:34,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:34,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:07:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:34,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555556249] [2025-02-05 15:07:34,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555556249] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:34,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516590606] [2025-02-05 15:07:34,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:34,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:34,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:34,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:34,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:07:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:07:34,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:07:34,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:34,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:34,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:07:34,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:07:34,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:34,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516590606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:34,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:07:34,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 15:07:34,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835967715] [2025-02-05 15:07:34,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:34,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:07:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:34,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:07:34,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:07:34,316 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:07:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:34,331 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2025-02-05 15:07:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:07:34,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-05 15:07:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:34,339 INFO L225 Difference]: With dead ends: 57 [2025-02-05 15:07:34,339 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 15:07:34,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:07:34,345 INFO L435 NwaCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:34,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 15:07:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-05 15:07:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:07:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-02-05 15:07:34,382 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2025-02-05 15:07:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:34,382 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-02-05 15:07:34,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:07:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-02-05 15:07:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:07:34,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:34,385 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:34,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:07:34,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:07:34,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:34,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1082556901, now seen corresponding path program 1 times [2025-02-05 15:07:34,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:34,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763610842] [2025-02-05 15:07:34,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:34,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:07:34,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:07:34,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:34,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:34,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732466019] [2025-02-05 15:07:34,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:34,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:34,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:34,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:07:34,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:07:34,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:07:34,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:34,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:34,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:07:34,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:07:34,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:34,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763610842] [2025-02-05 15:07:34,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:34,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732466019] [2025-02-05 15:07:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732466019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:07:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824314765] [2025-02-05 15:07:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:34,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:07:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:34,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:07:34,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:07:34,780 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:07:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:34,840 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2025-02-05 15:07:34,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:07:34,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-05 15:07:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:34,841 INFO L225 Difference]: With dead ends: 43 [2025-02-05 15:07:34,841 INFO L226 Difference]: Without dead ends: 41 [2025-02-05 15:07:34,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-02-05 15:07:34,842 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:34,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-05 15:07:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-02-05 15:07:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 states have internal predecessors, (28), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 15:07:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2025-02-05 15:07:34,849 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 19 [2025-02-05 15:07:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:34,849 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2025-02-05 15:07:34,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:07:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2025-02-05 15:07:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:07:34,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:34,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:34,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:07:35,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:35,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:35,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:35,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1083301676, now seen corresponding path program 1 times [2025-02-05 15:07:35,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:35,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419996103] [2025-02-05 15:07:35,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:35,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:35,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:07:35,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:07:35,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:35,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:07:35,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:35,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419996103] [2025-02-05 15:07:35,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419996103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:35,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:35,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:07:35,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522161850] [2025-02-05 15:07:35,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:35,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:07:35,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:35,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:07:35,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:07:35,152 INFO L87 Difference]: Start difference. First operand 40 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:07:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:35,186 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2025-02-05 15:07:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:07:35,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-05 15:07:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:35,188 INFO L225 Difference]: With dead ends: 56 [2025-02-05 15:07:35,189 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 15:07:35,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:07:35,189 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:35,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 15:07:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-05 15:07:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 15:07:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2025-02-05 15:07:35,196 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2025-02-05 15:07:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:35,196 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-02-05 15:07:35,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:07:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2025-02-05 15:07:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 15:07:35,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:35,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:35,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:07:35,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:35,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:35,197 INFO L85 PathProgramCache]: Analyzing trace with hash 160190426, now seen corresponding path program 1 times [2025-02-05 15:07:35,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:35,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200579419] [2025-02-05 15:07:35,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:35,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:35,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:07:35,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:07:35,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:35,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:35,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867739825] [2025-02-05 15:07:35,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:35,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:35,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:35,218 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-02-05 15:07:35,222 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-02-05 15:07:35,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:07:35,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:07:35,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:35,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:35,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:07:35,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:07:35,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:35,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:35,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200579419] [2025-02-05 15:07:35,325 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:35,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867739825] [2025-02-05 15:07:35,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867739825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:35,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:35,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:07:35,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328108795] [2025-02-05 15:07:35,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:35,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:07:35,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:35,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:07:35,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:07:35,328 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:07:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:35,393 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2025-02-05 15:07:35,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:07:35,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-02-05 15:07:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:35,394 INFO L225 Difference]: With dead ends: 67 [2025-02-05 15:07:35,395 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 15:07:35,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-02-05 15:07:35,396 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:35,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 15:07:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2025-02-05 15:07:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.375) internal successors, (44), 34 states have internal predecessors, (44), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 15:07:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-02-05 15:07:35,413 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 24 [2025-02-05 15:07:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:35,413 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-02-05 15:07:35,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:07:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-02-05 15:07:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 15:07:35,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:35,415 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:35,421 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-02-05 15:07:35,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:35,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:35,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1894458555, now seen corresponding path program 1 times [2025-02-05 15:07:35,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:35,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479689578] [2025-02-05 15:07:35,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:35,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:35,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:07:35,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:07:35,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:35,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452274905] [2025-02-05 15:07:35,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:35,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:35,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:35,632 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-02-05 15:07:35,634 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-02-05 15:07:35,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:07:35,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:07:35,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:35,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:35,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:07:35,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:07:35,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:35,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479689578] [2025-02-05 15:07:35,713 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452274905] [2025-02-05 15:07:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452274905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:35,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:35,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:07:35,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496669869] [2025-02-05 15:07:35,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:35,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:07:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:35,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:07:35,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:07:35,714 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:07:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:35,757 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2025-02-05 15:07:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:07:35,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-02-05 15:07:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:35,758 INFO L225 Difference]: With dead ends: 65 [2025-02-05 15:07:35,758 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 15:07:35,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-02-05 15:07:35,759 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:35,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 15:07:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-05 15:07:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 37 states have internal predecessors, (47), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 15:07:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2025-02-05 15:07:35,767 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 29 [2025-02-05 15:07:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:35,767 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2025-02-05 15:07:35,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:07:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2025-02-05 15:07:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 15:07:35,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:35,768 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:35,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:35,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:35,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:35,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1405186467, now seen corresponding path program 1 times [2025-02-05 15:07:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:35,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974914743] [2025-02-05 15:07:35,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:35,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 15:07:35,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 15:07:35,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:35,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:07:36,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:36,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974914743] [2025-02-05 15:07:36,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974914743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:36,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:36,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:07:36,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643163278] [2025-02-05 15:07:36,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:36,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:07:36,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:36,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:07:36,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:07:36,110 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 15:07:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:36,142 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2025-02-05 15:07:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:07:36,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2025-02-05 15:07:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:36,143 INFO L225 Difference]: With dead ends: 73 [2025-02-05 15:07:36,143 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 15:07:36,143 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-02-05 15:07:36,144 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:36,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 15:07:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-02-05 15:07:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 42 states have internal predecessors, (50), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 15:07:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2025-02-05 15:07:36,151 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 35 [2025-02-05 15:07:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:36,151 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2025-02-05 15:07:36,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 15:07:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2025-02-05 15:07:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 15:07:36,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:36,152 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:36,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:07:36,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:36,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1110371466, now seen corresponding path program 1 times [2025-02-05 15:07:36,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:36,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332394603] [2025-02-05 15:07:36,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:36,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:36,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:07:36,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:07:36,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:36,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:07:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332394603] [2025-02-05 15:07:36,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332394603] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779183654] [2025-02-05 15:07:36,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:36,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:36,254 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:36,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:07:36,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:07:36,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:07:36,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:36,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:36,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 15:07:36,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:07:36,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:07:36,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779183654] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:36,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:07:36,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-02-05 15:07:36,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217252542] [2025-02-05 15:07:36,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:36,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:07:36,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:36,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:07:36,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:07:36,404 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:07:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:36,493 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2025-02-05 15:07:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:07:36,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 38 [2025-02-05 15:07:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:36,495 INFO L225 Difference]: With dead ends: 200 [2025-02-05 15:07:36,495 INFO L226 Difference]: Without dead ends: 186 [2025-02-05 15:07:36,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:07:36,496 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 63 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:36,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 154 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:07:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-05 15:07:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 180. [2025-02-05 15:07:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 116 states have internal predecessors, (132), 51 states have call successors, (51), 21 states have call predecessors, (51), 20 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 15:07:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 227 transitions. [2025-02-05 15:07:36,517 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 227 transitions. Word has length 38 [2025-02-05 15:07:36,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:36,517 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 227 transitions. [2025-02-05 15:07:36,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:07:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 227 transitions. [2025-02-05 15:07:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 15:07:36,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:36,518 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:36,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:07:36,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:36,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:36,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash -223612560, now seen corresponding path program 1 times [2025-02-05 15:07:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:36,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700767217] [2025-02-05 15:07:36,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:36,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:07:36,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:07:36,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:36,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:36,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890060879] [2025-02-05 15:07:36,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:36,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:36,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:36,741 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:36,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:07:36,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:07:36,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:07:36,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:36,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:36,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:07:36,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:07:36,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700767217] [2025-02-05 15:07:36,848 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:36,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890060879] [2025-02-05 15:07:36,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890060879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:36,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:36,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:07:36,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281278222] [2025-02-05 15:07:36,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:36,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:07:36,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:36,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:07:36,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:07:36,849 INFO L87 Difference]: Start difference. First operand 180 states and 227 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:07:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:36,888 INFO L93 Difference]: Finished difference Result 203 states and 256 transitions. [2025-02-05 15:07:36,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:07:36,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2025-02-05 15:07:36,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:36,889 INFO L225 Difference]: With dead ends: 203 [2025-02-05 15:07:36,889 INFO L226 Difference]: Without dead ends: 201 [2025-02-05 15:07:36,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-02-05 15:07:36,890 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:36,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 112 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-05 15:07:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2025-02-05 15:07:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.205128205128205) internal successors, (141), 128 states have internal predecessors, (141), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 15:07:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2025-02-05 15:07:36,929 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2025-02-05 15:07:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:36,930 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2025-02-05 15:07:36,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:07:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2025-02-05 15:07:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 15:07:36,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:36,931 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:36,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:37,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 15:07:37,131 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:37,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2003437346, now seen corresponding path program 1 times [2025-02-05 15:07:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667051661] [2025-02-05 15:07:37,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:37,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 15:07:37,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 15:07:37,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:37,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:07:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667051661] [2025-02-05 15:07:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667051661] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722477080] [2025-02-05 15:07:37,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:37,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:37,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:37,324 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:37,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:07:37,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 15:07:37,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 15:07:37,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:37,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:37,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:07:37,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:07:37,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:37,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722477080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:37,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:07:37,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-05 15:07:37,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182625571] [2025-02-05 15:07:37,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:37,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:07:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:37,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:07:37,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:07:37,486 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 15:07:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:37,564 INFO L93 Difference]: Finished difference Result 230 states and 279 transitions. [2025-02-05 15:07:37,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:07:37,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2025-02-05 15:07:37,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:37,566 INFO L225 Difference]: With dead ends: 230 [2025-02-05 15:07:37,566 INFO L226 Difference]: Without dead ends: 220 [2025-02-05 15:07:37,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:07:37,566 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:37,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:07:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-05 15:07:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2025-02-05 15:07:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 130 states have (on average 1.176923076923077) internal successors, (153), 141 states have internal predecessors, (153), 57 states have call successors, (57), 28 states have call predecessors, (57), 28 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 15:07:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 261 transitions. [2025-02-05 15:07:37,597 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 261 transitions. Word has length 40 [2025-02-05 15:07:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:37,598 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 261 transitions. [2025-02-05 15:07:37,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 15:07:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 261 transitions. [2025-02-05 15:07:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 15:07:37,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:37,598 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:37,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:07:37,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:37,803 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:37,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash 905198032, now seen corresponding path program 1 times [2025-02-05 15:07:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:37,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058379493] [2025-02-05 15:07:37,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:37,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:37,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 15:07:37,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 15:07:37,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:37,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:37,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364820772] [2025-02-05 15:07:37,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:37,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:37,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:37,816 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:37,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:07:37,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 15:07:37,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 15:07:37,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:37,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:37,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 15:07:37,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:07:37,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:07:38,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058379493] [2025-02-05 15:07:38,036 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364820772] [2025-02-05 15:07:38,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364820772] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:38,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:07:38,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-02-05 15:07:38,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923297483] [2025-02-05 15:07:38,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:38,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:07:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:38,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:07:38,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:07:38,038 INFO L87 Difference]: Start difference. First operand 216 states and 261 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:07:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:38,346 INFO L93 Difference]: Finished difference Result 255 states and 317 transitions. [2025-02-05 15:07:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:07:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 43 [2025-02-05 15:07:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:38,348 INFO L225 Difference]: With dead ends: 255 [2025-02-05 15:07:38,348 INFO L226 Difference]: Without dead ends: 213 [2025-02-05 15:07:38,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:07:38,349 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:38,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 198 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:07:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-05 15:07:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 188. [2025-02-05 15:07:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 120 states have (on average 1.1583333333333334) internal successors, (139), 126 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 15:07:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2025-02-05 15:07:38,390 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 43 [2025-02-05 15:07:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:38,391 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2025-02-05 15:07:38,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:07:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2025-02-05 15:07:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 15:07:38,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:38,392 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:38,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:38,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:38,595 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:38,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash -346016538, now seen corresponding path program 1 times [2025-02-05 15:07:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627522449] [2025-02-05 15:07:38,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:38,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 15:07:38,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 15:07:38,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:38,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:38,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [550025163] [2025-02-05 15:07:38,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:38,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:38,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:38,626 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:38,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:07:38,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 15:07:38,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 15:07:38,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:38,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:38,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 15:07:38,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-05 15:07:38,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 15:07:39,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:39,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627522449] [2025-02-05 15:07:39,031 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:39,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550025163] [2025-02-05 15:07:39,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550025163] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:39,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:07:39,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-02-05 15:07:39,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636565599] [2025-02-05 15:07:39,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:39,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 15:07:39,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:39,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 15:07:39,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:07:39,033 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-05 15:07:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:39,289 INFO L93 Difference]: Finished difference Result 208 states and 246 transitions. [2025-02-05 15:07:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:07:39,289 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 57 [2025-02-05 15:07:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:39,291 INFO L225 Difference]: With dead ends: 208 [2025-02-05 15:07:39,291 INFO L226 Difference]: Without dead ends: 201 [2025-02-05 15:07:39,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-02-05 15:07:39,292 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:39,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 358 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:07:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-05 15:07:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 179. [2025-02-05 15:07:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 120 states have (on average 1.15) internal successors, (138), 122 states have internal predecessors, (138), 34 states have call successors, (34), 25 states have call predecessors, (34), 24 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 15:07:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2025-02-05 15:07:39,321 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 57 [2025-02-05 15:07:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2025-02-05 15:07:39,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-05 15:07:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2025-02-05 15:07:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 15:07:39,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:39,322 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:39,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 15:07:39,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:39,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:39,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash 337331480, now seen corresponding path program 1 times [2025-02-05 15:07:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:39,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440985861] [2025-02-05 15:07:39,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:39,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 15:07:39,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 15:07:39,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:39,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 15:07:39,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440985861] [2025-02-05 15:07:39,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440985861] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102092632] [2025-02-05 15:07:39,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:39,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:39,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:39,670 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:39,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:07:39,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 15:07:39,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 15:07:39,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:39,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:39,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:07:39,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 15:07:39,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 15:07:39,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102092632] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:39,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:07:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2025-02-05 15:07:39,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262548790] [2025-02-05 15:07:39,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:39,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:07:39,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:39,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:07:39,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:07:39,830 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 15:07:39,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:39,924 INFO L93 Difference]: Finished difference Result 205 states and 233 transitions. [2025-02-05 15:07:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:07:39,925 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 59 [2025-02-05 15:07:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:39,926 INFO L225 Difference]: With dead ends: 205 [2025-02-05 15:07:39,926 INFO L226 Difference]: Without dead ends: 185 [2025-02-05 15:07:39,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:07:39,927 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:39,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 178 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:07:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-05 15:07:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-02-05 15:07:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.1129032258064515) internal successors, (138), 128 states have internal predecessors, (138), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 15:07:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2025-02-05 15:07:39,945 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 59 [2025-02-05 15:07:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:39,946 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2025-02-05 15:07:39,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 15:07:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2025-02-05 15:07:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 15:07:39,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:39,947 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:39,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 15:07:40,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 15:07:40,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:40,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1373699756, now seen corresponding path program 2 times [2025-02-05 15:07:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096781292] [2025-02-05 15:07:40,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:07:40,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:40,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-05 15:07:40,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 15:07:40,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:07:40,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-05 15:07:40,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:40,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096781292] [2025-02-05 15:07:40,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096781292] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:40,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396621446] [2025-02-05 15:07:40,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:07:40,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:40,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:40,346 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:40,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:07:40,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-05 15:07:40,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 15:07:40,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:07:40,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:40,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:07:40,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:07:40,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-05 15:07:40,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396621446] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:40,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:07:40,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-02-05 15:07:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719324412] [2025-02-05 15:07:40,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:40,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 15:07:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:40,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 15:07:40,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:07:40,634 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 12 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2025-02-05 15:07:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:40,844 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2025-02-05 15:07:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 15:07:40,844 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 12 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) Word has length 95 [2025-02-05 15:07:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:40,847 INFO L225 Difference]: With dead ends: 512 [2025-02-05 15:07:40,848 INFO L226 Difference]: Without dead ends: 503 [2025-02-05 15:07:40,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:07:40,848 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 61 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:40,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 150 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:07:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-05 15:07:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-02-05 15:07:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 334 states have (on average 1.095808383233533) internal successors, (366), 344 states have internal predecessors, (366), 102 states have call successors, (102), 66 states have call predecessors, (102), 66 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 15:07:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2025-02-05 15:07:40,899 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2025-02-05 15:07:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:40,899 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2025-02-05 15:07:40,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 12 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2025-02-05 15:07:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2025-02-05 15:07:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 15:07:40,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:40,901 INFO L218 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:40,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 15:07:41,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 15:07:41,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:41,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash -822274580, now seen corresponding path program 3 times [2025-02-05 15:07:41,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:41,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228453724] [2025-02-05 15:07:41,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:07:41,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:41,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 209 statements into 22 equivalence classes. [2025-02-05 15:07:41,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 194 of 209 statements. [2025-02-05 15:07:41,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-02-05 15:07:41,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2025-02-05 15:07:41,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228453724] [2025-02-05 15:07:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228453724] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903631763] [2025-02-05 15:07:41,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:07:41,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:41,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:41,847 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:41,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:07:41,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 209 statements into 22 equivalence classes. [2025-02-05 15:07:41,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 194 of 209 statements. [2025-02-05 15:07:41,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-02-05 15:07:41,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:41,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 15:07:41,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 15:07:42,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2025-02-05 15:07:42,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903631763] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:42,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:07:42,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 14] total 38 [2025-02-05 15:07:42,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212117904] [2025-02-05 15:07:42,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:42,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-05 15:07:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:42,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-05 15:07:42,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=874, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 15:07:42,648 INFO L87 Difference]: Start difference. First operand 503 states and 568 transitions. Second operand has 38 states, 38 states have (on average 4.131578947368421) internal successors, (157), 38 states have internal predecessors, (157), 26 states have call successors, (94), 13 states have call predecessors, (94), 12 states have return successors, (93), 25 states have call predecessors, (93), 25 states have call successors, (93) [2025-02-05 15:07:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:43,459 INFO L93 Difference]: Finished difference Result 1148 states and 1345 transitions. [2025-02-05 15:07:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-05 15:07:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.131578947368421) internal successors, (157), 38 states have internal predecessors, (157), 26 states have call successors, (94), 13 states have call predecessors, (94), 12 states have return successors, (93), 25 states have call predecessors, (93), 25 states have call successors, (93) Word has length 209 [2025-02-05 15:07:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:43,466 INFO L225 Difference]: With dead ends: 1148 [2025-02-05 15:07:43,466 INFO L226 Difference]: Without dead ends: 1139 [2025-02-05 15:07:43,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1003, Invalid=1859, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 15:07:43,468 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 186 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:43,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 278 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:07:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-02-05 15:07:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2025-02-05 15:07:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 754 states have (on average 1.090185676392573) internal successors, (822), 776 states have internal predecessors, (822), 234 states have call successors, (234), 150 states have call predecessors, (234), 150 states have return successors, (232), 212 states have call predecessors, (232), 232 states have call successors, (232) [2025-02-05 15:07:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1288 transitions. [2025-02-05 15:07:43,578 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1288 transitions. Word has length 209 [2025-02-05 15:07:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:43,579 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1288 transitions. [2025-02-05 15:07:43,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.131578947368421) internal successors, (157), 38 states have internal predecessors, (157), 26 states have call successors, (94), 13 states have call predecessors, (94), 12 states have return successors, (93), 25 states have call predecessors, (93), 25 states have call successors, (93) [2025-02-05 15:07:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1288 transitions. [2025-02-05 15:07:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-05 15:07:43,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:43,591 INFO L218 NwaCegarLoop]: trace histogram [67, 66, 66, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:43,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:43,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:43,791 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:43,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash -994683796, now seen corresponding path program 4 times [2025-02-05 15:07:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:43,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119576449] [2025-02-05 15:07:43,792 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:07:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:43,805 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 437 statements into 2 equivalence classes. [2025-02-05 15:07:43,926 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 437 of 437 statements. [2025-02-05 15:07:43,926 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:07:43,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2025-02-05 15:07:45,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:45,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119576449] [2025-02-05 15:07:45,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119576449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:45,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478476572] [2025-02-05 15:07:45,224 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:07:45,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:45,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:45,230 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:45,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:07:45,280 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 437 statements into 2 equivalence classes. [2025-02-05 15:07:45,359 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 437 of 437 statements. [2025-02-05 15:07:45,359 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:07:45,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:45,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-05 15:07:45,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-05 15:07:45,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2025-02-05 15:07:46,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478476572] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:46,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:07:46,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 52 [2025-02-05 15:07:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273846481] [2025-02-05 15:07:46,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:46,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-05 15:07:46,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:46,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-05 15:07:46,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=1422, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 15:07:46,577 INFO L87 Difference]: Start difference. First operand 1139 states and 1288 transitions. Second operand has 52 states, 52 states have (on average 5.173076923076923) internal successors, (269), 52 states have internal predecessors, (269), 48 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 47 states have call predecessors, (204), 47 states have call successors, (204) [2025-02-05 15:07:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:48,106 INFO L93 Difference]: Finished difference Result 2420 states and 2833 transitions. [2025-02-05 15:07:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-02-05 15:07:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.173076923076923) internal successors, (269), 52 states have internal predecessors, (269), 48 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 47 states have call predecessors, (204), 47 states have call successors, (204) Word has length 437 [2025-02-05 15:07:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:48,115 INFO L225 Difference]: With dead ends: 2420 [2025-02-05 15:07:48,115 INFO L226 Difference]: Without dead ends: 2411 [2025-02-05 15:07:48,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3364, Invalid=5756, Unknown=0, NotChecked=0, Total=9120 [2025-02-05 15:07:48,117 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 427 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:48,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 380 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:07:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2025-02-05 15:07:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2411. [2025-02-05 15:07:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 1594 states have (on average 1.0878293601003763) internal successors, (1734), 1640 states have internal predecessors, (1734), 498 states have call successors, (498), 318 states have call predecessors, (498), 318 states have return successors, (496), 452 states have call predecessors, (496), 496 states have call successors, (496) [2025-02-05 15:07:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2728 transitions. [2025-02-05 15:07:48,313 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2728 transitions. Word has length 437 [2025-02-05 15:07:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:48,313 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 2728 transitions. [2025-02-05 15:07:48,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.173076923076923) internal successors, (269), 52 states have internal predecessors, (269), 48 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 47 states have call predecessors, (204), 47 states have call successors, (204) [2025-02-05 15:07:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2728 transitions. [2025-02-05 15:07:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2025-02-05 15:07:48,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:48,331 INFO L218 NwaCegarLoop]: trace histogram [139, 138, 138, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:48,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 15:07:48,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:48,536 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:48,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash -623046292, now seen corresponding path program 5 times [2025-02-05 15:07:48,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:48,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231635308] [2025-02-05 15:07:48,537 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:07:48,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:48,556 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 893 statements into 90 equivalence classes. [2025-02-05 15:07:49,161 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) and asserted 893 of 893 statements. [2025-02-05 15:07:49,161 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2025-02-05 15:07:49,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2025-02-05 15:07:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231635308] [2025-02-05 15:07:53,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231635308] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492758433] [2025-02-05 15:07:53,993 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:07:53,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:53,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:53,995 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:54,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 15:07:54,098 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 893 statements into 90 equivalence classes. [2025-02-05 15:08:03,276 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) and asserted 893 of 893 statements. [2025-02-05 15:08:03,277 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2025-02-05 15:08:03,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:08:03,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-02-05 15:08:03,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:08:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 44597 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2025-02-05 15:08:04,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:08:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2025-02-05 15:08:05,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492758433] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:08:05,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:08:05,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 50] total 55 [2025-02-05 15:08:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381837935] [2025-02-05 15:08:05,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:08:05,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-05 15:08:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:08:05,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-05 15:08:05,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1590, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 15:08:05,454 INFO L87 Difference]: Start difference. First operand 2411 states and 2728 transitions. Second operand has 55 states, 55 states have (on average 6.509090909090909) internal successors, (358), 55 states have internal predecessors, (358), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) [2025-02-05 15:08:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:08:07,076 INFO L93 Difference]: Finished difference Result 2632 states and 2993 transitions. [2025-02-05 15:08:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-02-05 15:08:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 6.509090909090909) internal successors, (358), 55 states have internal predecessors, (358), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) Word has length 893 [2025-02-05 15:08:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:08:07,088 INFO L225 Difference]: With dead ends: 2632 [2025-02-05 15:08:07,088 INFO L226 Difference]: Without dead ends: 2623 [2025-02-05 15:08:07,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1883 GetRequests, 1738 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2025-02-05 15:08:07,091 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 189 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:08:07,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 390 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:08:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2025-02-05 15:08:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2623. [2025-02-05 15:08:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 1734 states have (on average 1.0876585928489042) internal successors, (1886), 1784 states have internal predecessors, (1886), 542 states have call successors, (542), 346 states have call predecessors, (542), 346 states have return successors, (540), 492 states have call predecessors, (540), 540 states have call successors, (540) [2025-02-05 15:08:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 2968 transitions. [2025-02-05 15:08:07,292 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 2968 transitions. Word has length 893 [2025-02-05 15:08:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:08:07,293 INFO L471 AbstractCegarLoop]: Abstraction has 2623 states and 2968 transitions. [2025-02-05 15:08:07,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.509090909090909) internal successors, (358), 55 states have internal predecessors, (358), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) [2025-02-05 15:08:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 2968 transitions. [2025-02-05 15:08:07,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2025-02-05 15:08:07,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:08:07,303 INFO L218 NwaCegarLoop]: trace histogram [151, 150, 150, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:08:07,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 15:08:07,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:08:07,507 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:08:07,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:08:07,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2080321300, now seen corresponding path program 6 times [2025-02-05 15:08:07,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:08:07,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41154822] [2025-02-05 15:08:07,508 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:08:07,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:08:07,527 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 969 statements into 98 equivalence classes. [2025-02-05 15:08:07,998 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) and asserted 969 of 969 statements. [2025-02-05 15:08:07,998 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2025-02-05 15:08:07,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:08:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736093222] [2025-02-05 15:08:08,001 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:08:08,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:08:08,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:08:08,003 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:08:08,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 15:08:08,092 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 969 statements into 98 equivalence classes. [2025-02-05 15:08:10,665 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) and asserted 969 of 969 statements. [2025-02-05 15:08:10,665 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2025-02-05 15:08:10,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:08:10,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:08:10,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 969 statements into 1 equivalence classes. [2025-02-05 15:08:10,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 969 of 969 statements. [2025-02-05 15:08:10,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:08:10,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:08:10,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:08:10,998 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:08:10,998 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:08:11,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-05 15:08:11,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 15:08:11,202 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:08:11,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:08:11,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:08:11 BoogieIcfgContainer [2025-02-05 15:08:11,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:08:11,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:08:11,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:08:11,346 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:08:11,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:07:34" (3/4) ... [2025-02-05 15:08:11,348 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:08:11,485 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 661. [2025-02-05 15:08:11,653 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:08:11,653 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:08:11,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:08:11,654 INFO L158 Benchmark]: Toolchain (without parser) took 38090.15ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 109.7MB in the beginning and 756.8MB in the end (delta: -647.1MB). Peak memory consumption was 317.5MB. Max. memory is 16.1GB. [2025-02-05 15:08:11,654 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:08:11,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.34ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 98.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:08:11,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.69ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 97.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:08:11,654 INFO L158 Benchmark]: Boogie Preprocessor took 26.60ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:08:11,654 INFO L158 Benchmark]: IcfgBuilder took 243.28ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 83.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:08:11,654 INFO L158 Benchmark]: TraceAbstraction took 37325.43ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 83.3MB in the beginning and 807.1MB in the end (delta: -723.8MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. [2025-02-05 15:08:11,654 INFO L158 Benchmark]: Witness Printer took 307.67ms. Allocated memory is still 1.1GB. Free memory was 807.1MB in the beginning and 756.8MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-05 15:08:11,655 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.19ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.34ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 98.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.69ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 97.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.60ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 243.28ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 83.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 37325.43ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 83.3MB in the beginning and 807.1MB in the end (delta: -723.8MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. * Witness Printer took 307.67ms. Allocated memory is still 1.1GB. Free memory was 807.1MB in the beginning and 756.8MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. 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 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=52, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=52, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=52, b=1, counter=0, p=1, q=0, r=0, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=51, b=1, counter=1, p=1, q=0, r=-1, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=50, b=1, counter=2, p=1, q=0, r=-2, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=49, b=1, counter=3, p=1, q=0, r=-3, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=48, b=1, counter=4, p=1, q=0, r=-4, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=47, b=1, counter=5, p=1, q=0, r=-5, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=46, b=1, counter=6, p=1, q=0, r=-6, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=45, b=1, counter=7, p=1, q=0, r=-7, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=44, b=1, counter=8, p=1, q=0, r=-8, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=43, b=1, counter=9, p=1, q=0, r=-9, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=42, b=1, counter=10, p=1, q=0, r=-10, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=1, counter=11, p=1, q=0, r=-11, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=40, b=1, counter=12, p=1, q=0, r=-12, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=1, counter=13, p=1, q=0, r=-13, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=38, b=1, counter=14, p=1, q=0, r=-14, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=1, counter=15, p=1, q=0, r=-15, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=36, b=1, counter=16, p=1, q=0, r=-16, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=1, counter=17, p=1, q=0, r=-17, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=34, b=1, counter=18, p=1, q=0, r=-18, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=1, counter=19, p=1, q=0, r=-19, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=32, b=1, counter=20, p=1, q=0, r=-20, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=1, counter=21, p=1, q=0, r=-21, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=30, b=1, counter=22, p=1, q=0, r=-22, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=1, counter=23, p=1, q=0, r=-23, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=28, b=1, counter=24, p=1, q=0, r=-24, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=1, counter=25, p=1, q=0, r=-25, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=26, b=1, counter=26, p=1, q=0, r=-26, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=1, counter=27, p=1, q=0, r=-27, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=24, b=1, counter=28, p=1, q=0, r=-28, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=1, counter=29, p=1, q=0, r=-29, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=22, b=1, counter=30, p=1, q=0, r=-30, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=1, counter=31, p=1, q=0, r=-31, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=20, b=1, counter=32, p=1, q=0, r=-32, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=1, counter=33, p=1, q=0, r=-33, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=18, b=1, counter=34, p=1, q=0, r=-34, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=1, counter=35, p=1, q=0, r=-35, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=16, b=1, counter=36, p=1, q=0, r=-36, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=1, counter=37, p=1, q=0, r=-37, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=14, b=1, counter=38, p=1, q=0, r=-38, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=1, counter=39, p=1, q=0, r=-39, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=12, b=1, counter=40, p=1, q=0, r=-40, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=1, counter=41, p=1, q=0, r=-41, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=10, b=1, counter=42, p=1, q=0, r=-42, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=1, counter=43, p=1, q=0, r=-43, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=8, b=1, counter=44, p=1, q=0, r=-44, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=1, counter=45, p=1, q=0, r=-45, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=6, b=1, counter=46, p=1, q=0, r=-46, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=1, counter=47, p=1, q=0, r=-47, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=4, b=1, counter=48, p=1, q=0, r=-48, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=1, counter=49, p=1, q=0, r=-49, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=50, p=1, q=0, r=-50, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [a=2, b=1, counter=51, p=1, q=0, r=-50, s=1, x=52, y=1] [L34] COND FALSE !(counter++<50) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.1s, OverallIterations: 17, TraceHistogramMax: 151, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1049 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1022 mSDsluCounter, 2935 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2419 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1801 IncrementalHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 516 mSDtfsCounter, 1801 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4090 GetRequests, 3689 SyntacticMatches, 48 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2623occurred in iteration=16, InterpolantAutomatonStates: 337, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 71 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 13.5s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 5990 NumberOfCodeBlocks, 5960 NumberOfCodeBlocksAsserted, 446 NumberOfCheckSat, 5641 ConstructedInterpolants, 0 QuantifiedInterpolants, 12885 SizeOfPredicates, 100 NumberOfNonLiveVariables, 4595 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 100044/175668 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 proved your program to be incorrect! [2025-02-05 15:08:11,690 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE