./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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_unwindbound20.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 4aef2940f6d326843487f003443fc222e2136d386047f492f8bd5c7e21afc8f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:33:07,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:33:07,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:33:07,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:33:07,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:33:07,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:33:07,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:33:07,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:33:07,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:33:07,588 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:33:07,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:33:07,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:33:07,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:33:07,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:33:07,590 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:33:07,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:33:07,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:33:07,590 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:33:07,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:33:07,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:33:07,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:33:07,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:33:07,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:33:07,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:33:07,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:33:07,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:33:07,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:33:07,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:33:07,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:33:07,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:33:07,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:33:07,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:33:07,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:33:07,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:33:07,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:33:07,593 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:33:07,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:33:07,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:33:07,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:33:07,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:33:07,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:33:07,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:33:07,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:33:07,594 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 -> 4aef2940f6d326843487f003443fc222e2136d386047f492f8bd5c7e21afc8f5 [2025-02-07 20:33:07,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:33:07,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:33:07,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:33:07,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:33:07,887 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:33:07,888 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_unwindbound20.c [2025-02-07 20:33:09,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a31ba158/280292f05c804c00a73e0b6f0e765c22/FLAG8f99ceeeb [2025-02-07 20:33:09,363 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:33:09,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c [2025-02-07 20:33:09,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a31ba158/280292f05c804c00a73e0b6f0e765c22/FLAG8f99ceeeb [2025-02-07 20:33:09,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a31ba158/280292f05c804c00a73e0b6f0e765c22 [2025-02-07 20:33:09,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:33:09,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:33:09,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:33:09,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:33:09,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:33:09,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b0d8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09, skipping insertion in model container [2025-02-07 20:33:09,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:33:09,544 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_unwindbound20.c[489,502] [2025-02-07 20:33:09,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:33:09,575 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:33:09,586 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_unwindbound20.c[489,502] [2025-02-07 20:33:09,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:33:09,609 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:33:09,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09 WrapperNode [2025-02-07 20:33:09,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:33:09,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:33:09,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:33:09,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:33:09,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,636 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-02-07 20:33:09,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:33:09,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:33:09,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:33:09,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:33:09,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,661 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-07 20:33:09,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:33:09,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:33:09,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:33:09,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:33:09,677 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (1/1) ... [2025-02-07 20:33:09,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:33:09,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:09,704 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-07 20:33:09,706 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-07 20:33:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:33:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 20:33:09,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 20:33:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:33:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:33:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:33:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:33:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:33:09,774 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:33:09,776 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:33:09,926 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-07 20:33:09,926 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:33:09,938 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:33:09,939 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:33:09,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:33:09 BoogieIcfgContainer [2025-02-07 20:33:09,939 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:33:09,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:33:09,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:33:09,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:33:09,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:33:09" (1/3) ... [2025-02-07 20:33:09,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db115e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:33:09, skipping insertion in model container [2025-02-07 20:33:09,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:33:09" (2/3) ... [2025-02-07 20:33:09,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db115e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:33:09, skipping insertion in model container [2025-02-07 20:33:09,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:33:09" (3/3) ... [2025-02-07 20:33:09,949 INFO L128 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound20.c [2025-02-07 20:33:09,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:33:09,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG egcd-ll_unwindbound20.c that has 3 procedures, 28 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:33:10,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:33:10,026 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;@52655e1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:33:10,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:33:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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-07 20:33:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:33:10,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:10,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:10,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:10,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:10,041 INFO L85 PathProgramCache]: Analyzing trace with hash 898335684, now seen corresponding path program 1 times [2025-02-07 20:33:10,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:10,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316479419] [2025-02-07 20:33:10,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:10,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:33:10,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:33:10,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:10,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:10,144 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-07 20:33:10,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:10,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316479419] [2025-02-07 20:33:10,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316479419] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:10,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468054293] [2025-02-07 20:33:10,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:10,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:10,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:10,149 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-07 20:33:10,151 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-07 20:33:10,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:33:10,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:33:10,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:10,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:10,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 20:33:10,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:10,236 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-07 20:33:10,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:10,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468054293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:10,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:33:10,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 20:33:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578341893] [2025-02-07 20:33:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:10,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:33:10,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:10,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:33:10,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:33:10,255 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 5.5) internal successors, (11), 2 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), 2 states have call successors, (2) [2025-02-07 20:33:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:10,269 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2025-02-07 20:33:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:33:10,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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), 2 states have call successors, (2) Word has length 17 [2025-02-07 20:33:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:10,275 INFO L225 Difference]: With dead ends: 54 [2025-02-07 20:33:10,275 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 20:33:10,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-07 20:33:10,284 INFO L435 NwaCegarLoop]: 37 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, 37 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-07 20:33:10,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 20:33:10,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-07 20:33:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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-07 20:33:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-02-07 20:33:10,312 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 17 [2025-02-07 20:33:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:10,313 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-02-07 20:33:10,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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), 2 states have call successors, (2) [2025-02-07 20:33:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-02-07 20:33:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:33:10,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:10,315 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:10,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:33:10,516 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-07 20:33:10,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:10,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -956624687, now seen corresponding path program 1 times [2025-02-07 20:33:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206603868] [2025-02-07 20:33:10,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:10,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:33:10,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:33:10,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:10,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:10,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302865743] [2025-02-07 20:33:10,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:10,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:10,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:10,560 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-07 20:33:10,561 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-07 20:33:10,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:33:10,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:33:10,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:10,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:10,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-07 20:33:10,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:10,727 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-07 20:33:10,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:10,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:10,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206603868] [2025-02-07 20:33:10,728 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:10,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302865743] [2025-02-07 20:33:10,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302865743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:10,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:33:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473322141] [2025-02-07 20:33:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:10,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:33:10,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:10,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:33:10,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:33:10,731 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 20:33:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:10,808 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2025-02-07 20:33:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:33:10,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 18 [2025-02-07 20:33:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:10,810 INFO L225 Difference]: With dead ends: 42 [2025-02-07 20:33:10,810 INFO L226 Difference]: Without dead ends: 40 [2025-02-07 20:33:10,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-07 20:33:10,811 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 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.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:10,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:33:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-07 20:33:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-02-07 20:33:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 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-07 20:33:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2025-02-07 20:33:10,824 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 18 [2025-02-07 20:33:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:10,824 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2025-02-07 20:33:10,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 20:33:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2025-02-07 20:33:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:33:10,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:10,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:10,831 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-07 20:33:11,025 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-07 20:33:11,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:11,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:11,026 INFO L85 PathProgramCache]: Analyzing trace with hash -955879912, now seen corresponding path program 1 times [2025-02-07 20:33:11,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:11,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250652674] [2025-02-07 20:33:11,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:11,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:33:11,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:33:11,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:11,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:11,133 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-07 20:33:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250652674] [2025-02-07 20:33:11,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250652674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:11,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:11,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:33:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147789357] [2025-02-07 20:33:11,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:11,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:33:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:11,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:33:11,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:33:11,136 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-07 20:33:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:11,158 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2025-02-07 20:33:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:33:11,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 18 [2025-02-07 20:33:11,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:11,162 INFO L225 Difference]: With dead ends: 55 [2025-02-07 20:33:11,162 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 20:33:11,162 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-07 20:33:11,163 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 85 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-07 20:33:11,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 85 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 20:33:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-07 20:33:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 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-07 20:33:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-02-07 20:33:11,183 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 18 [2025-02-07 20:33:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:11,183 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-02-07 20:33:11,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-07 20:33:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-02-07 20:33:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:33:11,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:11,184 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:11,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:33:11,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:11,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1313637675, now seen corresponding path program 1 times [2025-02-07 20:33:11,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:11,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143109770] [2025-02-07 20:33:11,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:11,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:11,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:33:11,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:33:11,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:11,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [550246198] [2025-02-07 20:33:11,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:11,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:11,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:11,212 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-07 20:33:11,215 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-07 20:33:11,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:33:11,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:33:11,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:11,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:11,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-07 20:33:11,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:11,346 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-07 20:33:11,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:11,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143109770] [2025-02-07 20:33:11,346 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550246198] [2025-02-07 20:33:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550246198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:11,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:33:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380712065] [2025-02-07 20:33:11,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:11,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:33:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:11,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:33:11,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:33:11,348 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-07 20:33:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:11,413 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2025-02-07 20:33:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:33:11,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 23 [2025-02-07 20:33:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:11,415 INFO L225 Difference]: With dead ends: 66 [2025-02-07 20:33:11,415 INFO L226 Difference]: Without dead ends: 64 [2025-02-07 20:33:11,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-07 20:33:11,416 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:11,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:11,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-07 20:33:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2025-02-07 20:33:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 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-07 20:33:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-02-07 20:33:11,437 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 23 [2025-02-07 20:33:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:11,437 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-02-07 20:33:11,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-07 20:33:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-02-07 20:33:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 20:33:11,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:11,438 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] [2025-02-07 20:33:11,447 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-07 20:33:11,638 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-07 20:33:11,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:11,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1027252561, now seen corresponding path program 1 times [2025-02-07 20:33:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:11,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451056602] [2025-02-07 20:33:11,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:11,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:11,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 20:33:11,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 20:33:11,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:11,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103253949] [2025-02-07 20:33:11,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:11,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:11,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:11,663 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-07 20:33:11,666 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-07 20:33:11,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 20:33:11,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 20:33:11,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:11,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:11,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 20:33:11,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:11,790 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-07 20:33:11,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451056602] [2025-02-07 20:33:11,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103253949] [2025-02-07 20:33:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103253949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:11,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:11,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:33:11,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183093162] [2025-02-07 20:33:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:11,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:33:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:11,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:33:11,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:33:11,792 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-07 20:33:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:11,848 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2025-02-07 20:33:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:33:11,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 28 [2025-02-07 20:33:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:11,852 INFO L225 Difference]: With dead ends: 64 [2025-02-07 20:33:11,852 INFO L226 Difference]: Without dead ends: 60 [2025-02-07 20:33:11,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-07 20:33:11,853 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 107 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-07 20:33:11,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 107 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-07 20:33:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-07 20:33:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 36 states have internal predecessors, (46), 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-07 20:33:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2025-02-07 20:33:11,870 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 28 [2025-02-07 20:33:11,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:11,871 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2025-02-07 20:33:11,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-07 20:33:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2025-02-07 20:33:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 20:33:11,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:11,872 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] [2025-02-07 20:33:11,879 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-07 20:33:12,076 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-07 20:33:12,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:12,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash -234456630, now seen corresponding path program 1 times [2025-02-07 20:33:12,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:12,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230198415] [2025-02-07 20:33:12,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:12,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:12,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 20:33:12,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 20:33:12,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:12,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:12,221 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-07 20:33:12,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:12,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230198415] [2025-02-07 20:33:12,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230198415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:12,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:12,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:33:12,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064793045] [2025-02-07 20:33:12,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:12,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:33:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:12,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:33:12,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:33:12,224 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-07 20:33:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:12,275 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2025-02-07 20:33:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:33:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 34 [2025-02-07 20:33:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:12,277 INFO L225 Difference]: With dead ends: 72 [2025-02-07 20:33:12,278 INFO L226 Difference]: Without dead ends: 70 [2025-02-07 20:33:12,278 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-07 20:33:12,279 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 131 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-07 20:33:12,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 131 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-07 20:33:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-02-07 20:33:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 41 states have internal predecessors, (49), 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-07 20:33:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2025-02-07 20:33:12,298 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 34 [2025-02-07 20:33:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:12,298 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2025-02-07 20:33:12,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-07 20:33:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2025-02-07 20:33:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 20:33:12,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:12,299 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] [2025-02-07 20:33:12,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:33:12,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:12,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1884812455, now seen corresponding path program 1 times [2025-02-07 20:33:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:12,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145586338] [2025-02-07 20:33:12,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:12,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:33:12,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:33:12,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:12,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:12,476 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-07 20:33:12,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145586338] [2025-02-07 20:33:12,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145586338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:12,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863303510] [2025-02-07 20:33:12,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:12,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:12,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:12,481 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-07 20:33:12,482 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-07 20:33:12,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:33:12,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:33:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:12,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:33:12,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:12,594 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-07 20:33:12,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:12,667 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-07 20:33:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863303510] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:12,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:33:12,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-02-07 20:33:12,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408852644] [2025-02-07 20:33:12,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:12,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:33:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:12,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:33:12,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:33:12,670 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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-07 20:33:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:12,789 INFO L93 Difference]: Finished difference Result 199 states and 254 transitions. [2025-02-07 20:33:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:33:12,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 37 [2025-02-07 20:33:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:12,792 INFO L225 Difference]: With dead ends: 199 [2025-02-07 20:33:12,793 INFO L226 Difference]: Without dead ends: 185 [2025-02-07 20:33:12,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:33:12,794 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 52 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:12,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 121 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:33:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-07 20:33:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2025-02-07 20:33:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 115 states have internal predecessors, (131), 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-07 20:33:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 226 transitions. [2025-02-07 20:33:12,830 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 226 transitions. Word has length 37 [2025-02-07 20:33:12,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:12,830 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 226 transitions. [2025-02-07 20:33:12,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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-07 20:33:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 226 transitions. [2025-02-07 20:33:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 20:33:12,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:12,831 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] [2025-02-07 20:33:12,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 20:33:13,031 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-07 20:33:13,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:13,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1523395935, now seen corresponding path program 1 times [2025-02-07 20:33:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076355789] [2025-02-07 20:33:13,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:13,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:13,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:33:13,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:33:13,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:13,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:13,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887216306] [2025-02-07 20:33:13,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:13,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:13,051 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-07 20:33:13,053 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-07 20:33:13,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:33:13,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:33:13,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:13,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:13,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:33:13,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:13,180 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-07 20:33:13,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:13,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:13,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076355789] [2025-02-07 20:33:13,180 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:13,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887216306] [2025-02-07 20:33:13,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887216306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:13,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:33:13,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:33:13,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616332443] [2025-02-07 20:33:13,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:13,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:33:13,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:13,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:33:13,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:33:13,183 INFO L87 Difference]: Start difference. First operand 179 states and 226 transitions. Second operand has 5 states, 5 states have (on average 3.0) 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), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 20:33:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:13,248 INFO L93 Difference]: Finished difference Result 202 states and 255 transitions. [2025-02-07 20:33:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:33:13,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) 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), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2025-02-07 20:33:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:13,250 INFO L225 Difference]: With dead ends: 202 [2025-02-07 20:33:13,250 INFO L226 Difference]: Without dead ends: 200 [2025-02-07 20:33:13,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-07 20:33:13,251 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 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-07 20:33:13,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:33:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-07 20:33:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-02-07 20:33:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 116 states have (on average 1.206896551724138) internal successors, (140), 127 states have internal predecessors, (140), 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-07 20:33:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2025-02-07 20:33:13,285 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 37 [2025-02-07 20:33:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:13,285 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2025-02-07 20:33:13,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 20:33:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2025-02-07 20:33:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 20:33:13,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:13,286 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] [2025-02-07 20:33:13,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 20:33:13,486 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-07 20:33:13,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:13,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1924237458, now seen corresponding path program 1 times [2025-02-07 20:33:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:13,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225179714] [2025-02-07 20:33:13,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:13,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:13,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:33:13,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:33:13,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:13,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:13,653 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-07 20:33:13,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225179714] [2025-02-07 20:33:13,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225179714] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503760827] [2025-02-07 20:33:13,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:13,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:13,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:13,655 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-07 20:33:13,657 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-07 20:33:13,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:33:13,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:33:13,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:13,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:13,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:33:13,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:13,821 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-07 20:33:13,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:33:13,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503760827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:33:13,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:33:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-07 20:33:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351440757] [2025-02-07 20:33:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:33:13,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:33:13,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:13,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:33:13,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:33:13,824 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-07 20:33:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:13,932 INFO L93 Difference]: Finished difference Result 229 states and 278 transitions. [2025-02-07 20:33:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:33:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 39 [2025-02-07 20:33:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:13,936 INFO L225 Difference]: With dead ends: 229 [2025-02-07 20:33:13,936 INFO L226 Difference]: Without dead ends: 219 [2025-02-07 20:33:13,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 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-07 20:33:13,938 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 131 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-07 20:33:13,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 131 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:33:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-07 20:33:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2025-02-07 20:33:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 129 states have (on average 1.178294573643411) internal successors, (152), 140 states have internal predecessors, (152), 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-07 20:33:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 260 transitions. [2025-02-07 20:33:13,976 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 260 transitions. Word has length 39 [2025-02-07 20:33:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:13,977 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 260 transitions. [2025-02-07 20:33:13,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-07 20:33:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 260 transitions. [2025-02-07 20:33:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 20:33:13,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:13,978 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] [2025-02-07 20:33:13,987 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-07 20:33:14,178 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-07 20:33:14,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:14,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1828962300, now seen corresponding path program 1 times [2025-02-07 20:33:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:14,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826260024] [2025-02-07 20:33:14,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:14,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 20:33:14,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 20:33:14,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:14,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987163388] [2025-02-07 20:33:14,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:14,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:14,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:14,201 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-07 20:33:14,204 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-07 20:33:14,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 20:33:14,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 20:33:14,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:14,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:14,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 20:33:14,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:14,415 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-07 20:33:14,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:14,516 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-07 20:33:14,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:14,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826260024] [2025-02-07 20:33:14,516 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:14,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987163388] [2025-02-07 20:33:14,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987163388] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:14,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:33:14,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-02-07 20:33:14,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156049473] [2025-02-07 20:33:14,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:14,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:33:14,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:14,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:33:14,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:33:14,517 INFO L87 Difference]: Start difference. First operand 215 states and 260 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-07 20:33:18,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:33:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:18,945 INFO L93 Difference]: Finished difference Result 290 states and 378 transitions. [2025-02-07 20:33:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:33:18,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 42 [2025-02-07 20:33:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:18,950 INFO L225 Difference]: With dead ends: 290 [2025-02-07 20:33:18,950 INFO L226 Difference]: Without dead ends: 248 [2025-02-07 20:33:18,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 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-07 20:33:18,952 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 18 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:18,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 190 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-07 20:33:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-07 20:33:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 235. [2025-02-07 20:33:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 143 states have (on average 1.2237762237762237) internal successors, (175), 152 states have internal predecessors, (175), 67 states have call successors, (67), 25 states have call predecessors, (67), 24 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-07 20:33:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 302 transitions. [2025-02-07 20:33:18,998 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 302 transitions. Word has length 42 [2025-02-07 20:33:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:18,999 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 302 transitions. [2025-02-07 20:33:18,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-07 20:33:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 302 transitions. [2025-02-07 20:33:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 20:33:19,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:19,000 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] [2025-02-07 20:33:19,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 20:33:19,205 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-07 20:33:19,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:19,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1239305138, now seen corresponding path program 1 times [2025-02-07 20:33:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:19,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263725484] [2025-02-07 20:33:19,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:19,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 20:33:19,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 20:33:19,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:19,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:19,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416468009] [2025-02-07 20:33:19,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:19,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:19,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:19,229 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-07 20:33:19,231 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-07 20:33:19,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 20:33:19,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 20:33:19,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:19,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:19,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-07 20:33:19,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:19,548 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-07 20:33:19,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:19,760 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-07 20:33:19,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263725484] [2025-02-07 20:33:19,760 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416468009] [2025-02-07 20:33:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416468009] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:19,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:33:19,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-02-07 20:33:19,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785270494] [2025-02-07 20:33:19,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:19,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 20:33:19,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:19,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 20:33:19,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-07 20:33:19,764 INFO L87 Difference]: Start difference. First operand 235 states and 302 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 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-07 20:33:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:20,094 INFO L93 Difference]: Finished difference Result 245 states and 311 transitions. [2025-02-07 20:33:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:33:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 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 56 [2025-02-07 20:33:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:20,096 INFO L225 Difference]: With dead ends: 245 [2025-02-07 20:33:20,096 INFO L226 Difference]: Without dead ends: 241 [2025-02-07 20:33:20,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 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-07 20:33:20,097 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:20,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 402 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:33:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-07 20:33:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 236. [2025-02-07 20:33:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 149 states have (on average 1.2147651006711409) internal successors, (181), 155 states have internal predecessors, (181), 60 states have call successors, (60), 27 states have call predecessors, (60), 26 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-07 20:33:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 296 transitions. [2025-02-07 20:33:20,148 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 296 transitions. Word has length 56 [2025-02-07 20:33:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:20,148 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 296 transitions. [2025-02-07 20:33:20,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 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-07 20:33:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 296 transitions. [2025-02-07 20:33:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-07 20:33:20,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:20,150 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] [2025-02-07 20:33:20,159 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-07 20:33:20,350 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-07 20:33:20,350 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:20,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:20,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1704787613, now seen corresponding path program 1 times [2025-02-07 20:33:20,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:20,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981552161] [2025-02-07 20:33:20,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:20,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:20,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-07 20:33:20,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-07 20:33:20,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:20,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:20,558 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-07 20:33:20,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:20,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981552161] [2025-02-07 20:33:20,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981552161] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:20,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4990106] [2025-02-07 20:33:20,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:33:20,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:20,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:20,561 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-07 20:33:20,565 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-07 20:33:20,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-07 20:33:20,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-07 20:33:20,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:33:20,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:20,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-07 20:33:20,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:20,682 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-07 20:33:20,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:20,794 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-07 20:33:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4990106] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:20,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:33:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2025-02-07 20:33:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161099347] [2025-02-07 20:33:20,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:20,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:33:20,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:20,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:33:20,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:33:20,796 INFO L87 Difference]: Start difference. First operand 236 states and 296 transitions. Second operand has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-07 20:33:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:20,946 INFO L93 Difference]: Finished difference Result 276 states and 346 transitions. [2025-02-07 20:33:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 20:33:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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 58 [2025-02-07 20:33:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:20,948 INFO L225 Difference]: With dead ends: 276 [2025-02-07 20:33:20,949 INFO L226 Difference]: Without dead ends: 262 [2025-02-07 20:33:20,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 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-07 20:33:20,949 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:20,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 165 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:33:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-07 20:33:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2025-02-07 20:33:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 175 states have internal predecessors, (194), 64 states have call successors, (64), 29 states have call predecessors, (64), 29 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-07 20:33:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 318 transitions. [2025-02-07 20:33:20,990 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 318 transitions. Word has length 58 [2025-02-07 20:33:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:20,990 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 318 transitions. [2025-02-07 20:33:20,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-07 20:33:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 318 transitions. [2025-02-07 20:33:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-07 20:33:20,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:20,991 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:20,999 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-07 20:33:21,196 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-07 20:33:21,196 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:21,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:21,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1854680752, now seen corresponding path program 2 times [2025-02-07 20:33:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:21,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425884105] [2025-02-07 20:33:21,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:33:21,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:21,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-07 20:33:21,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-07 20:33:21,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:33:21,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-07 20:33:21,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:21,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425884105] [2025-02-07 20:33:21,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425884105] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:21,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115647431] [2025-02-07 20:33:21,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:33:21,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:21,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:21,292 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-07 20:33:21,294 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-07 20:33:21,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-07 20:33:21,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-07 20:33:21,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:33:21,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:21,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:33:21,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-07 20:33:21,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-07 20:33:21,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115647431] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:21,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:33:21,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2025-02-07 20:33:21,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689309241] [2025-02-07 20:33:21,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:21,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 20:33:21,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:21,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 20:33:21,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:33:21,467 INFO L87 Difference]: Start difference. First operand 260 states and 318 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 20:33:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:21,615 INFO L93 Difference]: Finished difference Result 276 states and 337 transitions. [2025-02-07 20:33:21,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:33:21,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2025-02-07 20:33:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:21,618 INFO L225 Difference]: With dead ends: 276 [2025-02-07 20:33:21,618 INFO L226 Difference]: Without dead ends: 254 [2025-02-07 20:33:21,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:33:21,621 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:21,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:33:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-07 20:33:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2025-02-07 20:33:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 163 states have (on average 1.147239263803681) internal successors, (187), 169 states have internal predecessors, (187), 60 states have call successors, (60), 28 states have call predecessors, (60), 28 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-07 20:33:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 304 transitions. [2025-02-07 20:33:21,659 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 304 transitions. Word has length 66 [2025-02-07 20:33:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:21,660 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 304 transitions. [2025-02-07 20:33:21,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 20:33:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 304 transitions. [2025-02-07 20:33:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 20:33:21,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:21,661 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:21,670 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-07 20:33:21,862 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-07 20:33:21,862 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:21,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:21,862 INFO L85 PathProgramCache]: Analyzing trace with hash 864912827, now seen corresponding path program 3 times [2025-02-07 20:33:21,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:21,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067627522] [2025-02-07 20:33:21,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:33:21,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:21,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 6 equivalence classes. [2025-02-07 20:33:21,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 20:33:21,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-07 20:33:21,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:21,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122701799] [2025-02-07 20:33:21,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:33:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:21,903 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-07 20:33:21,905 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-07 20:33:21,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 6 equivalence classes. [2025-02-07 20:33:21,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 46 of 80 statements. [2025-02-07 20:33:21,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 20:33:21,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:21,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 20:33:21,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-02-07 20:33:27,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:31,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067627522] [2025-02-07 20:33:31,767 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:31,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122701799] [2025-02-07 20:33:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122701799] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:31,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:33:31,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-02-07 20:33:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065677587] [2025-02-07 20:33:31,767 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:31,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:33:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:31,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:33:31,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:33:31,769 INFO L87 Difference]: Start difference. First operand 252 states and 304 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-07 20:33:37,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:33:40,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:33:42,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:33:46,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:33:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:48,178 INFO L93 Difference]: Finished difference Result 312 states and 384 transitions. [2025-02-07 20:33:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 20:33:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 80 [2025-02-07 20:33:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:48,181 INFO L225 Difference]: With dead ends: 312 [2025-02-07 20:33:48,181 INFO L226 Difference]: Without dead ends: 310 [2025-02-07 20:33:48,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-02-07 20:33:48,182 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:48,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 392 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 15.2s Time] [2025-02-07 20:33:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-07 20:33:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 298. [2025-02-07 20:33:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 192 states have (on average 1.1614583333333333) internal successors, (223), 199 states have internal predecessors, (223), 72 states have call successors, (72), 33 states have call predecessors, (72), 33 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-07 20:33:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 364 transitions. [2025-02-07 20:33:48,232 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 364 transitions. Word has length 80 [2025-02-07 20:33:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:48,232 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 364 transitions. [2025-02-07 20:33:48,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-07 20:33:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 364 transitions. [2025-02-07 20:33:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-07 20:33:48,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:48,234 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:48,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-07 20:33:48,438 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-07 20:33:48,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:48,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:48,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1090692926, now seen corresponding path program 4 times [2025-02-07 20:33:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882180280] [2025-02-07 20:33:48,438 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:33:48,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:48,445 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-02-07 20:33:48,477 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-02-07 20:33:48,478 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:33:48,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478932758] [2025-02-07 20:33:48,479 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:33:48,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:48,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:48,481 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-07 20:33:48,483 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-07 20:33:48,512 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-02-07 20:33:48,534 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 80 of 85 statements. [2025-02-07 20:33:48,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 20:33:48,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:48,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 20:33:48,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 22 proven. 39 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-02-07 20:33:49,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-07 20:33:49,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:49,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882180280] [2025-02-07 20:33:49,825 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:49,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478932758] [2025-02-07 20:33:49,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478932758] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:49,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:33:49,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-02-07 20:33:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614891042] [2025-02-07 20:33:49,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:49,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 20:33:49,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:49,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 20:33:49,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-02-07 20:33:49,827 INFO L87 Difference]: Start difference. First operand 298 states and 364 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 17 states have internal predecessors, (45), 10 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-02-07 20:33:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:51,739 INFO L93 Difference]: Finished difference Result 402 states and 520 transitions. [2025-02-07 20:33:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-07 20:33:51,739 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 17 states have internal predecessors, (45), 10 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 85 [2025-02-07 20:33:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:51,741 INFO L225 Difference]: With dead ends: 402 [2025-02-07 20:33:51,741 INFO L226 Difference]: Without dead ends: 397 [2025-02-07 20:33:51,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2025-02-07 20:33:51,742 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:51,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 547 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-07 20:33:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-07 20:33:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 369. [2025-02-07 20:33:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 237 states have (on average 1.1940928270042195) internal successors, (283), 242 states have internal predecessors, (283), 93 states have call successors, (93), 38 states have call predecessors, (93), 38 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-07 20:33:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 466 transitions. [2025-02-07 20:33:51,805 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 466 transitions. Word has length 85 [2025-02-07 20:33:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:51,805 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 466 transitions. [2025-02-07 20:33:51,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 17 states have internal predecessors, (45), 10 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-02-07 20:33:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 466 transitions. [2025-02-07 20:33:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-07 20:33:51,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:51,806 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] [2025-02-07 20:33:51,814 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-07 20:33:52,010 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-07 20:33:52,011 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:52,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1662798504, now seen corresponding path program 2 times [2025-02-07 20:33:52,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:52,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777151628] [2025-02-07 20:33:52,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:33:52,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:52,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-07 20:33:52,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-07 20:33:52,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:33:52,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:52,259 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-07 20:33:52,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:52,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777151628] [2025-02-07 20:33:52,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777151628] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:33:52,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888483033] [2025-02-07 20:33:52,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:33:52,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:52,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:52,262 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-07 20:33:52,264 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-07 20:33:52,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-07 20:33:52,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-07 20:33:52,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:33:52,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:52,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:33:52,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:52,429 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-07 20:33:52,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:52,585 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-07 20:33:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888483033] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:52,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:33:52,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-02-07 20:33:52,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750304872] [2025-02-07 20:33:52,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:52,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:33:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:52,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:33:52,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:33:52,588 INFO L87 Difference]: Start difference. First operand 369 states and 466 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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-07 20:33:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:53,101 INFO L93 Difference]: Finished difference Result 1500 states and 1986 transitions. [2025-02-07 20:33:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 20:33:53,101 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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 94 [2025-02-07 20:33:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:53,108 INFO L225 Difference]: With dead ends: 1500 [2025-02-07 20:33:53,108 INFO L226 Difference]: Without dead ends: 1479 [2025-02-07 20:33:53,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2025-02-07 20:33:53,109 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 89 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:53,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 207 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:33:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2025-02-07 20:33:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1469. [2025-02-07 20:33:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 947 states have (on average 1.1520591341077087) internal successors, (1091), 955 states have internal predecessors, (1091), 381 states have call successors, (381), 140 states have call predecessors, (381), 140 states have return successors, (378), 373 states have call predecessors, (378), 378 states have call successors, (378) [2025-02-07 20:33:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1850 transitions. [2025-02-07 20:33:53,369 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1850 transitions. Word has length 94 [2025-02-07 20:33:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:53,369 INFO L471 AbstractCegarLoop]: Abstraction has 1469 states and 1850 transitions. [2025-02-07 20:33:53,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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-07 20:33:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1850 transitions. [2025-02-07 20:33:53,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-07 20:33:53,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:53,371 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:53,379 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-07 20:33:53,575 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-07 20:33:53,575 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:53,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash 802801131, now seen corresponding path program 2 times [2025-02-07 20:33:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273322739] [2025-02-07 20:33:53,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:33:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:53,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-07 20:33:53,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 20:33:53,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:33:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738101891] [2025-02-07 20:33:53,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:33:53,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:53,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:53,607 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-07 20:33:53,609 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-07 20:33:53,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-07 20:33:53,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 20:33:53,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:33:53,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:53,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-07 20:33:53,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 29 proven. 58 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-02-07 20:33:54,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-02-07 20:33:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:54,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273322739] [2025-02-07 20:33:54,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:54,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738101891] [2025-02-07 20:33:54,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738101891] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:54,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:33:54,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2025-02-07 20:33:54,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572430732] [2025-02-07 20:33:54,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:54,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:33:54,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:54,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:33:54,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:33:54,491 INFO L87 Difference]: Start difference. First operand 1469 states and 1850 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 15 states have internal predecessors, (51), 11 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 12 states have call predecessors, (29), 11 states have call successors, (29) [2025-02-07 20:33:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:55,528 INFO L93 Difference]: Finished difference Result 1866 states and 2395 transitions. [2025-02-07 20:33:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 20:33:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 15 states have internal predecessors, (51), 11 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 12 states have call predecessors, (29), 11 states have call successors, (29) Word has length 99 [2025-02-07 20:33:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:55,540 INFO L225 Difference]: With dead ends: 1866 [2025-02-07 20:33:55,540 INFO L226 Difference]: Without dead ends: 1864 [2025-02-07 20:33:55,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-02-07 20:33:55,541 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 40 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:55,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 589 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 20:33:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2025-02-07 20:33:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1823. [2025-02-07 20:33:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1174 states have (on average 1.1584327086882453) internal successors, (1360), 1181 states have internal predecessors, (1360), 483 states have call successors, (483), 165 states have call predecessors, (483), 165 states have return successors, (480), 476 states have call predecessors, (480), 480 states have call successors, (480) [2025-02-07 20:33:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2323 transitions. [2025-02-07 20:33:55,921 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2323 transitions. Word has length 99 [2025-02-07 20:33:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:55,921 INFO L471 AbstractCegarLoop]: Abstraction has 1823 states and 2323 transitions. [2025-02-07 20:33:55,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 15 states have internal predecessors, (51), 11 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (29), 12 states have call predecessors, (29), 11 states have call successors, (29) [2025-02-07 20:33:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2323 transitions. [2025-02-07 20:33:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-07 20:33:55,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:55,925 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:33:55,934 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-07 20:33:56,125 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-07 20:33:56,125 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:56,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash 907287981, now seen corresponding path program 5 times [2025-02-07 20:33:56,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:56,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113904385] [2025-02-07 20:33:56,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 20:33:56,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:56,131 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 9 equivalence classes. [2025-02-07 20:33:56,154 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 20:33:56,154 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-02-07 20:33:56,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:33:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50803280] [2025-02-07 20:33:56,155 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 20:33:56,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:33:56,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:33:56,157 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:33:56,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-07 20:33:56,188 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 9 equivalence classes. [2025-02-07 20:33:56,292 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 99 of 99 statements. [2025-02-07 20:33:56,293 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-02-07 20:33:56,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:33:56,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-07 20:33:56,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:33:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 34 proven. 86 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-02-07 20:33:56,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:33:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 34 proven. 86 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-02-07 20:33:57,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:33:57,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113904385] [2025-02-07 20:33:57,029 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:33:57,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50803280] [2025-02-07 20:33:57,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50803280] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:33:57,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:33:57,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2025-02-07 20:33:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915584405] [2025-02-07 20:33:57,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:33:57,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-07 20:33:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:33:57,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-07 20:33:57,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-02-07 20:33:57,031 INFO L87 Difference]: Start difference. First operand 1823 states and 2323 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2025-02-07 20:33:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:33:58,694 INFO L93 Difference]: Finished difference Result 1868 states and 2382 transitions. [2025-02-07 20:33:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 20:33:58,695 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) Word has length 99 [2025-02-07 20:33:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:33:58,703 INFO L225 Difference]: With dead ends: 1868 [2025-02-07 20:33:58,703 INFO L226 Difference]: Without dead ends: 1859 [2025-02-07 20:33:58,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-02-07 20:33:58,706 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:33:58,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 473 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 20:33:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-02-07 20:33:59,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1748. [2025-02-07 20:33:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1130 states have (on average 1.1504424778761062) internal successors, (1300), 1137 states have internal predecessors, (1300), 454 states have call successors, (454), 163 states have call predecessors, (454), 163 states have return successors, (452), 447 states have call predecessors, (452), 452 states have call successors, (452) [2025-02-07 20:33:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2206 transitions. [2025-02-07 20:33:59,094 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2206 transitions. Word has length 99 [2025-02-07 20:33:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:33:59,094 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2206 transitions. [2025-02-07 20:33:59,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2025-02-07 20:33:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2206 transitions. [2025-02-07 20:33:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-07 20:33:59,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:33:59,106 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] [2025-02-07 20:33:59,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-07 20:33:59,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-07 20:33:59,306 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:33:59,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:33:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash -348373960, now seen corresponding path program 3 times [2025-02-07 20:33:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:33:59,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694969824] [2025-02-07 20:33:59,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:33:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:33:59,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 208 statements into 22 equivalence classes. [2025-02-07 20:33:59,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 193 of 208 statements. [2025-02-07 20:33:59,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-02-07 20:33:59,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:34:00,303 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-07 20:34:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:34:00,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694969824] [2025-02-07 20:34:00,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694969824] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:34:00,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679019331] [2025-02-07 20:34:00,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:34:00,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:34:00,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:34:00,307 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:34:00,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-07 20:34:00,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 208 statements into 22 equivalence classes. [2025-02-07 20:34:00,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 193 of 208 statements. [2025-02-07 20:34:00,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-02-07 20:34:00,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:34:00,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-07 20:34:00,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:34:00,846 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-07 20:34:00,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:34:01,214 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-07 20:34:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679019331] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:34:01,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:34:01,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 14] total 42 [2025-02-07 20:34:01,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520746383] [2025-02-07 20:34:01,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:34:01,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-07 20:34:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:34:01,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-07 20:34:01,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1262, Unknown=0, NotChecked=0, Total=1722 [2025-02-07 20:34:01,217 INFO L87 Difference]: Start difference. First operand 1748 states and 2206 transitions. Second operand has 42 states, 42 states have (on average 3.9047619047619047) internal successors, (164), 42 states have internal predecessors, (164), 30 states have call successors, (94), 13 states have call predecessors, (94), 12 states have return successors, (93), 29 states have call predecessors, (93), 29 states have call successors, (93) [2025-02-07 20:34:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:34:02,546 INFO L93 Difference]: Finished difference Result 4257 states and 5695 transitions. [2025-02-07 20:34:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-07 20:34:02,547 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.9047619047619047) internal successors, (164), 42 states have internal predecessors, (164), 30 states have call successors, (94), 13 states have call predecessors, (94), 12 states have return successors, (93), 29 states have call predecessors, (93), 29 states have call successors, (93) Word has length 208 [2025-02-07 20:34:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:34:02,569 INFO L225 Difference]: With dead ends: 4257 [2025-02-07 20:34:02,570 INFO L226 Difference]: Without dead ends: 4248 [2025-02-07 20:34:02,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 393 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1123, Invalid=2537, Unknown=0, NotChecked=0, Total=3660 [2025-02-07 20:34:02,572 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 145 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:34:02,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 386 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:34:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4248 states. [2025-02-07 20:34:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4248 to 4248. [2025-02-07 20:34:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4248 states, 2700 states have (on average 1.1481481481481481) internal successors, (3100), 2717 states have internal predecessors, (3100), 1174 states have call successors, (1174), 373 states have call predecessors, (1174), 373 states have return successors, (1172), 1157 states have call predecessors, (1172), 1172 states have call successors, (1172) [2025-02-07 20:34:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 4248 states and 5446 transitions. [2025-02-07 20:34:03,505 INFO L78 Accepts]: Start accepts. Automaton has 4248 states and 5446 transitions. Word has length 208 [2025-02-07 20:34:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:34:03,506 INFO L471 AbstractCegarLoop]: Abstraction has 4248 states and 5446 transitions. [2025-02-07 20:34:03,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.9047619047619047) internal successors, (164), 42 states have internal predecessors, (164), 30 states have call successors, (94), 13 states have call predecessors, (94), 12 states have return successors, (93), 29 states have call predecessors, (93), 29 states have call successors, (93) [2025-02-07 20:34:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4248 states and 5446 transitions. [2025-02-07 20:34:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-02-07 20:34:03,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:34:03,525 INFO L218 NwaCegarLoop]: trace histogram [61, 60, 60, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:34:03,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-07 20:34:03,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:34:03,731 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:34:03,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:34:03,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1670124120, now seen corresponding path program 4 times [2025-02-07 20:34:03,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:34:03,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564623651] [2025-02-07 20:34:03,732 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:34:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:34:03,746 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 398 statements into 2 equivalence classes. [2025-02-07 20:34:03,831 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-02-07 20:34:03,832 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:34:03,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:34:03,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477082904] [2025-02-07 20:34:03,835 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:34:03,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:34:03,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:34:03,837 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:34:03,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-07 20:34:03,900 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 398 statements into 2 equivalence classes. [2025-02-07 20:34:03,997 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-02-07 20:34:03,997 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:34:03,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:34:03,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:34:04,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-02-07 20:34:04,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-02-07 20:34:04,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:34:04,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:34:04,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:34:04,238 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:34:04,239 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:34:04,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-07 20:34:04,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:34:04,444 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:34:04,550 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:34:04,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:34:04 BoogieIcfgContainer [2025-02-07 20:34:04,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:34:04,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:34:04,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:34:04,553 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:34:04,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:33:09" (3/4) ... [2025-02-07 20:34:04,554 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:34:04,660 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 271. [2025-02-07 20:34:04,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:34:04,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:34:04,809 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:34:04,809 INFO L158 Benchmark]: Toolchain (without parser) took 55420.30ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 112.8MB in the beginning and 198.3MB in the end (delta: -85.5MB). Peak memory consumption was 303.2MB. Max. memory is 16.1GB. [2025-02-07 20:34:04,809 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:34:04,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.73ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:34:04,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.96ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:34:04,810 INFO L158 Benchmark]: Boogie Preprocessor took 34.33ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 99.0MB in the end (delta: 894.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:34:04,810 INFO L158 Benchmark]: IcfgBuilder took 263.56ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 86.9MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:34:04,810 INFO L158 Benchmark]: TraceAbstraction took 54610.16ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 86.0MB in the beginning and 219.3MB in the end (delta: -133.3MB). Peak memory consumption was 269.7MB. Max. memory is 16.1GB. [2025-02-07 20:34:04,810 INFO L158 Benchmark]: Witness Printer took 256.01ms. Allocated memory is still 536.9MB. Free memory was 219.3MB in the beginning and 198.3MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:34:04,811 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.26ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.73ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.96ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.33ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 99.0MB in the end (delta: 894.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 263.56ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 86.9MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 54610.16ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 86.0MB in the beginning and 219.3MB in the end (delta: -133.3MB). Peak memory consumption was 269.7MB. Max. memory is 16.1GB. * Witness Printer took 256.01ms. Allocated memory is still 536.9MB. Free memory was 219.3MB in the beginning and 198.3MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. 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; [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=22, 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=22, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=22, b=1, counter=0, p=1, q=0, r=0, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=22, b=1, counter=1, p=1, q=0, r=0, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=22, b=1, counter=1, p=1, q=0, r=0, s=1, x=22, 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=22, b=1, counter=1, p=1, q=0, r=0, s=1, x=22, 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=22, b=1, counter=1, p=1, q=0, r=0, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=22, b=1, counter=1, p=1, q=0, r=0, s=1, x=22, 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=1, p=1, q=0, r=-1, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=21, b=1, counter=2, p=1, q=0, r=-1, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=21, b=1, counter=2, p=1, q=0, r=-1, s=1, x=22, 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=21, b=1, counter=2, p=1, q=0, r=-1, s=1, x=22, 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=21, b=1, counter=2, p=1, q=0, r=-1, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=1, counter=2, p=1, q=0, r=-1, s=1, x=22, 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=2, p=1, q=0, r=-2, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=20, b=1, counter=3, p=1, q=0, r=-2, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=20, b=1, counter=3, p=1, q=0, r=-2, s=1, x=22, 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=20, b=1, counter=3, p=1, q=0, r=-2, s=1, x=22, 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=20, b=1, counter=3, p=1, q=0, r=-2, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=20, b=1, counter=3, p=1, q=0, r=-2, s=1, x=22, 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=3, p=1, q=0, r=-3, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=19, b=1, counter=4, p=1, q=0, r=-3, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=19, b=1, counter=4, p=1, q=0, r=-3, s=1, x=22, 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=19, b=1, counter=4, p=1, q=0, r=-3, s=1, x=22, 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=19, b=1, counter=4, p=1, q=0, r=-3, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=1, counter=4, p=1, q=0, r=-3, s=1, x=22, 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=4, p=1, q=0, r=-4, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=18, b=1, counter=5, p=1, q=0, r=-4, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=18, b=1, counter=5, p=1, q=0, r=-4, s=1, x=22, 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=18, b=1, counter=5, p=1, q=0, r=-4, s=1, x=22, 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=18, b=1, counter=5, p=1, q=0, r=-4, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=18, b=1, counter=5, p=1, q=0, r=-4, s=1, x=22, 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=5, p=1, q=0, r=-5, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=17, b=1, counter=6, p=1, q=0, r=-5, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=17, b=1, counter=6, p=1, q=0, r=-5, s=1, x=22, 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=17, b=1, counter=6, p=1, q=0, r=-5, s=1, x=22, 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=17, b=1, counter=6, p=1, q=0, r=-5, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=1, counter=6, p=1, q=0, r=-5, s=1, x=22, 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=6, p=1, q=0, r=-6, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=16, b=1, counter=7, p=1, q=0, r=-6, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=16, b=1, counter=7, p=1, q=0, r=-6, s=1, x=22, 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=16, b=1, counter=7, p=1, q=0, r=-6, s=1, x=22, 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=16, b=1, counter=7, p=1, q=0, r=-6, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=16, b=1, counter=7, p=1, q=0, r=-6, s=1, x=22, 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=7, p=1, q=0, r=-7, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=15, b=1, counter=8, p=1, q=0, r=-7, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=15, b=1, counter=8, p=1, q=0, r=-7, s=1, x=22, 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=15, b=1, counter=8, p=1, q=0, r=-7, s=1, x=22, 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=15, b=1, counter=8, p=1, q=0, r=-7, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=1, counter=8, p=1, q=0, r=-7, s=1, x=22, 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=8, p=1, q=0, r=-8, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=14, b=1, counter=9, p=1, q=0, r=-8, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=14, b=1, counter=9, p=1, q=0, r=-8, s=1, x=22, 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=14, b=1, counter=9, p=1, q=0, r=-8, s=1, x=22, 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=14, b=1, counter=9, p=1, q=0, r=-8, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=14, b=1, counter=9, p=1, q=0, r=-8, s=1, x=22, 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=9, p=1, q=0, r=-9, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=13, b=1, counter=10, p=1, q=0, r=-9, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=13, b=1, counter=10, p=1, q=0, r=-9, s=1, x=22, 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=13, b=1, counter=10, p=1, q=0, r=-9, s=1, x=22, 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=13, b=1, counter=10, p=1, q=0, r=-9, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=1, counter=10, p=1, q=0, r=-9, s=1, x=22, 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=10, p=1, q=0, r=-10, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=12, b=1, counter=11, p=1, q=0, r=-10, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=12, b=1, counter=11, p=1, q=0, r=-10, s=1, x=22, 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=12, b=1, counter=11, p=1, q=0, r=-10, s=1, x=22, 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=12, b=1, counter=11, p=1, q=0, r=-10, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=12, b=1, counter=11, p=1, q=0, r=-10, s=1, x=22, 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=11, p=1, q=0, r=-11, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=11, b=1, counter=12, p=1, q=0, r=-11, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=11, b=1, counter=12, p=1, q=0, r=-11, s=1, x=22, 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=11, b=1, counter=12, p=1, q=0, r=-11, s=1, x=22, 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=11, b=1, counter=12, p=1, q=0, r=-11, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=1, counter=12, p=1, q=0, r=-11, s=1, x=22, 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=12, p=1, q=0, r=-12, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=10, b=1, counter=13, p=1, q=0, r=-12, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=10, b=1, counter=13, p=1, q=0, r=-12, s=1, x=22, 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=10, b=1, counter=13, p=1, q=0, r=-12, s=1, x=22, 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=10, b=1, counter=13, p=1, q=0, r=-12, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=10, b=1, counter=13, p=1, q=0, r=-12, s=1, x=22, 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=13, p=1, q=0, r=-13, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=9, b=1, counter=14, p=1, q=0, r=-13, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=9, b=1, counter=14, p=1, q=0, r=-13, s=1, x=22, 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=9, b=1, counter=14, p=1, q=0, r=-13, s=1, x=22, 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=9, b=1, counter=14, p=1, q=0, r=-13, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=1, counter=14, p=1, q=0, r=-13, s=1, x=22, 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=14, p=1, q=0, r=-14, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=8, b=1, counter=15, p=1, q=0, r=-14, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=8, b=1, counter=15, p=1, q=0, r=-14, s=1, x=22, 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=8, b=1, counter=15, p=1, q=0, r=-14, s=1, x=22, 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=8, b=1, counter=15, p=1, q=0, r=-14, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=8, b=1, counter=15, p=1, q=0, r=-14, s=1, x=22, 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=15, p=1, q=0, r=-15, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=7, b=1, counter=16, p=1, q=0, r=-15, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=7, b=1, counter=16, p=1, q=0, r=-15, s=1, x=22, 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=7, b=1, counter=16, p=1, q=0, r=-15, s=1, x=22, 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=7, b=1, counter=16, p=1, q=0, r=-15, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=16, p=1, q=0, r=-15, s=1, x=22, 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=16, p=1, q=0, r=-16, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=6, b=1, counter=17, p=1, q=0, r=-16, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=6, b=1, counter=17, p=1, q=0, r=-16, s=1, x=22, 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=6, b=1, counter=17, p=1, q=0, r=-16, s=1, x=22, 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=6, b=1, counter=17, p=1, q=0, r=-16, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=17, p=1, q=0, r=-16, s=1, x=22, 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=17, p=1, q=0, r=-17, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=5, b=1, counter=18, p=1, q=0, r=-17, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=5, b=1, counter=18, p=1, q=0, r=-17, s=1, x=22, 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=5, b=1, counter=18, p=1, q=0, r=-17, s=1, x=22, 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=5, b=1, counter=18, p=1, q=0, r=-17, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=18, p=1, q=0, r=-17, s=1, x=22, 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=18, p=1, q=0, r=-18, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=4, b=1, counter=19, p=1, q=0, r=-18, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=4, b=1, counter=19, p=1, q=0, r=-18, s=1, x=22, 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=4, b=1, counter=19, p=1, q=0, r=-18, s=1, x=22, 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=4, b=1, counter=19, p=1, q=0, r=-18, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=19, p=1, q=0, r=-18, s=1, x=22, 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=19, p=1, q=0, r=-19, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=3, b=1, counter=20, p=1, q=0, r=-19, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=3, b=1, counter=20, p=1, q=0, r=-19, s=1, x=22, 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=3, b=1, counter=20, p=1, q=0, r=-19, s=1, x=22, 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=3, b=1, counter=20, p=1, q=0, r=-19, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=20, p=1, q=0, r=-19, s=1, x=22, 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=20, p=1, q=0, r=-20, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L34] EXPR counter++ VAL [a=2, b=1, counter=21, p=1, q=0, r=-20, s=1, x=22, y=1] [L34] COND FALSE !(counter++<20) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=21] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L13] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.4s, OverallIterations: 20, TraceHistogramMax: 61, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 28.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 578 SdHoareTripleChecker+Valid, 23.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 4399 SdHoareTripleChecker+Invalid, 23.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3719 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2950 IncrementalHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 680 mSDtfsCounter, 2950 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2057 GetRequests, 1794 SyntacticMatches, 8 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4248occurred in iteration=19, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 248 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 3020 NumberOfCodeBlocks, 2951 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 2465 ConstructedInterpolants, 0 QuantifiedInterpolants, 10601 SizeOfPredicates, 49 NumberOfNonLiveVariables, 2695 ConjunctsInSsa, 345 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 7632/11098 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-07 20:34:04,846 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