./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_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-?-c00e63d-m [2025-02-05 15:07:29,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:07:29,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:07:29,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:07:29,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:07:29,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:07:29,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:07:29,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:07:29,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:07:29,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:07:29,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:07:29,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:07:29,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:07:29,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:07:29,726 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:07:29,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:07:29,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:07:29,726 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:07:29,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:07:29,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:07:29,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:07:29,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:07:29,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:07:29,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:07:29,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:07:29,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:07:29,728 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-05 15:07:29,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:07:29,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:07:29,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:07:29,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:07:29,975 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:07:29,976 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-05 15:07:31,100 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a7736f37/648c6fbf8ed84ae199bd988e0c07a2ab/FLAGbf80666b8 [2025-02-05 15:07:31,289 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:07:31,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c [2025-02-05 15:07:31,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a7736f37/648c6fbf8ed84ae199bd988e0c07a2ab/FLAGbf80666b8 [2025-02-05 15:07:31,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a7736f37/648c6fbf8ed84ae199bd988e0c07a2ab [2025-02-05 15:07:31,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:07:31,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:07:31,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:07:31,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:07:31,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:07:31,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605eda5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31, skipping insertion in model container [2025-02-05 15:07:31,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:07:31,767 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-05 15:07:31,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:07:31,796 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:07:31,803 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-05 15:07:31,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:07:31,815 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:07:31,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31 WrapperNode [2025-02-05 15:07:31,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:07:31,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:07:31,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:07:31,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:07:31,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,832 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-02-05 15:07:31,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:07:31,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:07:31,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:07:31,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:07:31,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,845 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:07:31,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,847 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:07:31,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:07:31,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:07:31,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:07:31,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (1/1) ... [2025-02-05 15:07:31,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:07:31,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:31,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:07:31,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:07:31,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:07:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 15:07:31,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 15:07:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:07:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:07:31,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:07:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 15:07:31,897 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 15:07:31,933 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:07:31,935 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:07:32,047 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-05 15:07:32,047 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:07:32,054 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:07:32,055 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:07:32,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:07:32 BoogieIcfgContainer [2025-02-05 15:07:32,055 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:07:32,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:07:32,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:07:32,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:07:32,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:07:31" (1/3) ... [2025-02-05 15:07:32,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5734d788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:07:32, skipping insertion in model container [2025-02-05 15:07:32,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:07:31" (2/3) ... [2025-02-05 15:07:32,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5734d788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:07:32, skipping insertion in model container [2025-02-05 15:07:32,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:07:32" (3/3) ... [2025-02-05 15:07:32,064 INFO L128 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound20.c [2025-02-05 15:07:32,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:07:32,075 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG egcd-ll_unwindbound20.c that has 3 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:07:32,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:07:32,122 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;@4a30201e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:07:32,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:07:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:07:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 15:07:32,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:32,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:32,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:32,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:32,135 INFO L85 PathProgramCache]: Analyzing trace with hash 825598194, now seen corresponding path program 1 times [2025-02-05 15:07:32,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:32,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765168871] [2025-02-05 15:07:32,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:32,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:07:32,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:07:32,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:32,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:07:32,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:32,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765168871] [2025-02-05 15:07:32,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765168871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:32,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196925017] [2025-02-05 15:07:32,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:32,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:32,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:32,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:32,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:07:32,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:07:32,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:07:32,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:32,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:32,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:07:32,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:07:32,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196925017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:07:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 15:07:32,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502698592] [2025-02-05 15:07:32,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:32,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:07:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:32,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:07:32,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:07:32,340 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:07:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:32,353 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2025-02-05 15:07:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:07:32,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-05 15:07:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:32,358 INFO L225 Difference]: With dead ends: 57 [2025-02-05 15:07:32,358 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 15:07:32,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:07:32,365 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:32,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 15:07:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-05 15:07:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:07:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-02-05 15:07:32,391 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2025-02-05 15:07:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:32,391 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-02-05 15:07:32,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:07:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-02-05 15:07:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:07:32,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:32,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:32,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:07:32,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:07:32,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:32,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1082556901, now seen corresponding path program 1 times [2025-02-05 15:07:32,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:32,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123010769] [2025-02-05 15:07:32,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:32,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:32,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:07:32,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:07:32,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:32,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2024062193] [2025-02-05 15:07:32,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:32,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:32,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:32,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:32,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:07:32,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:07:32,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:07:32,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:32,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:32,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:07:32,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:07:32,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:32,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123010769] [2025-02-05 15:07:32,760 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:32,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024062193] [2025-02-05 15:07:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024062193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:32,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:32,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:07:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335661467] [2025-02-05 15:07:32,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:32,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:07:32,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:32,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:07:32,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:07:32,762 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:07:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:32,815 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2025-02-05 15:07:32,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:07:32,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-05 15:07:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:32,818 INFO L225 Difference]: With dead ends: 43 [2025-02-05 15:07:32,818 INFO L226 Difference]: Without dead ends: 41 [2025-02-05 15:07:32,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:07:32,819 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:32,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-05 15:07:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-02-05 15:07:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 states have internal predecessors, (28), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 15:07:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2025-02-05 15:07:32,827 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 19 [2025-02-05 15:07:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:32,827 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2025-02-05 15:07:32,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:07:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2025-02-05 15:07:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:07:32,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:32,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:32,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:33,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:33,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:33,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1083301676, now seen corresponding path program 1 times [2025-02-05 15:07:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:33,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806940221] [2025-02-05 15:07:33,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:33,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:07:33,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:07:33,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:33,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:07:33,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:33,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806940221] [2025-02-05 15:07:33,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806940221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:33,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:33,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:07:33,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357660029] [2025-02-05 15:07:33,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:33,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:07:33,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:33,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:07:33,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:07:33,121 INFO L87 Difference]: Start difference. First operand 40 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:07:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:33,135 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2025-02-05 15:07:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:07:33,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-05 15:07:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:33,136 INFO L225 Difference]: With dead ends: 56 [2025-02-05 15:07:33,136 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 15:07:33,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:07:33,137 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:33,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 15:07:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-05 15:07:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 15:07:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2025-02-05 15:07:33,144 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2025-02-05 15:07:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:33,144 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-02-05 15:07:33,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:07:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2025-02-05 15:07:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 15:07:33,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:33,145 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:33,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:07:33,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:33,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash 160190426, now seen corresponding path program 1 times [2025-02-05 15:07:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:33,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005727295] [2025-02-05 15:07:33,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:33,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:07:33,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:07:33,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:33,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:33,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486999604] [2025-02-05 15:07:33,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:33,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:33,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:33,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:33,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:07:33,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:07:33,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:07:33,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:33,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:33,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:07:33,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:07:33,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005727295] [2025-02-05 15:07:33,274 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486999604] [2025-02-05 15:07:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486999604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:33,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:33,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:07:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216196105] [2025-02-05 15:07:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:33,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:07:33,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:33,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:07:33,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:07:33,276 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:07:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:33,339 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2025-02-05 15:07:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:07:33,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-02-05 15:07:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:33,341 INFO L225 Difference]: With dead ends: 67 [2025-02-05 15:07:33,341 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 15:07:33,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:07:33,341 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:33,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 15:07:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2025-02-05 15:07:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.375) internal successors, (44), 34 states have internal predecessors, (44), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 15:07:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-02-05 15:07:33,359 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 24 [2025-02-05 15:07:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:33,360 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-02-05 15:07:33,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:07:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-02-05 15:07:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 15:07:33,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:33,361 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:33,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:33,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:33,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:33,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1894458555, now seen corresponding path program 1 times [2025-02-05 15:07:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:33,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717297680] [2025-02-05 15:07:33,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:33,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:07:33,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:07:33,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:33,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:33,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207932038] [2025-02-05 15:07:33,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:33,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:33,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:33,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:33,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:07:33,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:07:33,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:07:33,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:33,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:33,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:07:33,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:07:33,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:33,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:33,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717297680] [2025-02-05 15:07:33,670 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:33,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207932038] [2025-02-05 15:07:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207932038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:33,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:33,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:07:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112649674] [2025-02-05 15:07:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:33,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:07:33,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:33,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:07:33,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:07:33,671 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:07:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:33,717 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2025-02-05 15:07:33,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:07:33,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-02-05 15:07:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:33,718 INFO L225 Difference]: With dead ends: 65 [2025-02-05 15:07:33,718 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 15:07:33,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:07:33,719 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:33,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 15:07:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-05 15:07:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 37 states have internal predecessors, (47), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 15:07:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2025-02-05 15:07:33,735 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 29 [2025-02-05 15:07:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:33,735 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2025-02-05 15:07:33,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:07:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2025-02-05 15:07:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 15:07:33,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:33,737 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:33,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:33,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:33,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:33,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1405186467, now seen corresponding path program 1 times [2025-02-05 15:07:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034333291] [2025-02-05 15:07:33,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:33,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 15:07:33,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 15:07:33,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:33,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:07:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:34,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034333291] [2025-02-05 15:07:34,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034333291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:34,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:34,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:07:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722703835] [2025-02-05 15:07:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:34,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:07:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:34,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:07:34,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:07:34,053 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 15:07:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:34,091 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2025-02-05 15:07:34,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:07:34,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2025-02-05 15:07:34,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:34,092 INFO L225 Difference]: With dead ends: 73 [2025-02-05 15:07:34,092 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 15:07:34,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:07:34,093 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:34,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 15:07:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-02-05 15:07:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 42 states have internal predecessors, (50), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 15:07:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2025-02-05 15:07:34,109 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 35 [2025-02-05 15:07:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:34,109 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2025-02-05 15:07:34,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 15:07:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2025-02-05 15:07:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 15:07:34,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:34,110 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:34,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:07:34,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:34,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:34,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1110371466, now seen corresponding path program 1 times [2025-02-05 15:07:34,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:34,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972844005] [2025-02-05 15:07:34,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:34,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:34,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:07:34,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:07:34,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:34,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:07:34,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:34,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972844005] [2025-02-05 15:07:34,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972844005] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:34,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787675536] [2025-02-05 15:07:34,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:34,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:34,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:34,232 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:34,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:07:34,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:07:34,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:07:34,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:34,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:34,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 15:07:34,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:07:34,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:07:34,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787675536] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:34,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:07:34,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-02-05 15:07:34,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652240638] [2025-02-05 15:07:34,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:34,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:07:34,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:34,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:07:34,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:07:34,385 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:07:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:34,489 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2025-02-05 15:07:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:07:34,489 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 38 [2025-02-05 15:07:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:34,490 INFO L225 Difference]: With dead ends: 200 [2025-02-05 15:07:34,490 INFO L226 Difference]: Without dead ends: 186 [2025-02-05 15:07:34,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:07:34,491 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 63 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:34,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 154 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:07:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-05 15:07:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 180. [2025-02-05 15:07:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 116 states have internal predecessors, (132), 51 states have call successors, (51), 21 states have call predecessors, (51), 20 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 15:07:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 227 transitions. [2025-02-05 15:07:34,507 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 227 transitions. Word has length 38 [2025-02-05 15:07:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:34,507 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 227 transitions. [2025-02-05 15:07:34,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:07:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 227 transitions. [2025-02-05 15:07:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 15:07:34,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:34,508 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:34,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:07:34,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:34,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:34,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash -223612560, now seen corresponding path program 1 times [2025-02-05 15:07:34,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:34,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500215845] [2025-02-05 15:07:34,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:34,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:34,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:07:34,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:07:34,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:34,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:34,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56844718] [2025-02-05 15:07:34,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:34,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:34,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:34,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:34,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:07:34,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:07:34,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:07:34,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:34,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:34,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:07:34,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:07:34,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:34,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500215845] [2025-02-05 15:07:34,887 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56844718] [2025-02-05 15:07:34,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56844718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:34,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:07:34,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:07:34,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425177828] [2025-02-05 15:07:34,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:34,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:07:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:34,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:07:34,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:07:34,888 INFO L87 Difference]: Start difference. First operand 180 states and 227 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:07:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:34,927 INFO L93 Difference]: Finished difference Result 203 states and 256 transitions. [2025-02-05 15:07:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:07:34,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2025-02-05 15:07:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:34,929 INFO L225 Difference]: With dead ends: 203 [2025-02-05 15:07:34,929 INFO L226 Difference]: Without dead ends: 201 [2025-02-05 15:07:34,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:07:34,930 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:34,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 112 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-05 15:07:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2025-02-05 15:07:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.205128205128205) internal successors, (141), 128 states have internal predecessors, (141), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 15:07:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2025-02-05 15:07:34,956 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2025-02-05 15:07:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:34,956 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2025-02-05 15:07:34,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:07:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2025-02-05 15:07:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 15:07:34,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:34,956 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:34,966 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-05 15:07:35,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 15:07:35,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:35,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2003437346, now seen corresponding path program 1 times [2025-02-05 15:07:35,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:35,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170506220] [2025-02-05 15:07:35,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:35,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:35,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 15:07:35,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 15:07:35,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:35,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:07:35,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170506220] [2025-02-05 15:07:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170506220] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034765456] [2025-02-05 15:07:35,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:35,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:35,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:35,309 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:35,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:07:35,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 15:07:35,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 15:07:35,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:35,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:35,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:07:35,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:07:35,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:07:35,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034765456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:07:35,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:07:35,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-05 15:07:35,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588689418] [2025-02-05 15:07:35,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:07:35,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:07:35,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:35,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:07:35,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:07:35,429 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 15:07:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:35,503 INFO L93 Difference]: Finished difference Result 230 states and 279 transitions. [2025-02-05 15:07:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:07:35,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2025-02-05 15:07:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:35,505 INFO L225 Difference]: With dead ends: 230 [2025-02-05 15:07:35,505 INFO L226 Difference]: Without dead ends: 220 [2025-02-05 15:07:35,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:07:35,506 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:35,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:07:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-05 15:07:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2025-02-05 15:07:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 130 states have (on average 1.176923076923077) internal successors, (153), 141 states have internal predecessors, (153), 57 states have call successors, (57), 28 states have call predecessors, (57), 28 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 15:07:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 261 transitions. [2025-02-05 15:07:35,523 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 261 transitions. Word has length 40 [2025-02-05 15:07:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:35,523 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 261 transitions. [2025-02-05 15:07:35,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 15:07:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 261 transitions. [2025-02-05 15:07:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 15:07:35,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:35,524 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:35,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:07:35,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:35,728 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:35,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash 905198032, now seen corresponding path program 1 times [2025-02-05 15:07:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:35,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800773276] [2025-02-05 15:07:35,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:35,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:35,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 15:07:35,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 15:07:35,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:35,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:35,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636785788] [2025-02-05 15:07:35,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:35,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:35,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:35,747 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:35,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:07:35,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 15:07:35,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 15:07:35,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:35,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:35,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 15:07:35,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:07:35,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:07:35,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:35,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800773276] [2025-02-05 15:07:35,968 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:35,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636785788] [2025-02-05 15:07:35,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636785788] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:35,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:07:35,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-02-05 15:07:35,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005227673] [2025-02-05 15:07:35,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:35,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:07:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:35,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:07:35,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:07:35,970 INFO L87 Difference]: Start difference. First operand 216 states and 261 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:07:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:36,345 INFO L93 Difference]: Finished difference Result 255 states and 317 transitions. [2025-02-05 15:07:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:07:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 43 [2025-02-05 15:07:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:36,346 INFO L225 Difference]: With dead ends: 255 [2025-02-05 15:07:36,347 INFO L226 Difference]: Without dead ends: 213 [2025-02-05 15:07:36,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:07:36,347 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:36,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 198 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:07:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-05 15:07:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 188. [2025-02-05 15:07:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 120 states have (on average 1.1583333333333334) internal successors, (139), 126 states have internal predecessors, (139), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 15:07:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2025-02-05 15:07:36,371 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 43 [2025-02-05 15:07:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2025-02-05 15:07:36,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:07:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2025-02-05 15:07:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 15:07:36,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:36,372 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:36,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:36,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:36,573 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:36,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash -346016538, now seen corresponding path program 1 times [2025-02-05 15:07:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:36,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588380371] [2025-02-05 15:07:36,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:36,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:36,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 15:07:36,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 15:07:36,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:36,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:36,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159241123] [2025-02-05 15:07:36,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:36,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:36,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:36,589 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:36,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:07:36,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 15:07:36,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 15:07:36,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:36,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:36,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 15:07:36,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-05 15:07:36,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 15:07:37,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:37,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588380371] [2025-02-05 15:07:37,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:07:37,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159241123] [2025-02-05 15:07:37,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159241123] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:37,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:07:37,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-02-05 15:07:37,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653681802] [2025-02-05 15:07:37,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:37,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 15:07:37,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:37,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 15:07:37,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:07:37,024 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-05 15:07:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:37,251 INFO L93 Difference]: Finished difference Result 208 states and 246 transitions. [2025-02-05 15:07:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:07:37,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 57 [2025-02-05 15:07:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:37,254 INFO L225 Difference]: With dead ends: 208 [2025-02-05 15:07:37,254 INFO L226 Difference]: Without dead ends: 201 [2025-02-05 15:07:37,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-02-05 15:07:37,255 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:37,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 358 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:07:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-05 15:07:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 179. [2025-02-05 15:07:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 120 states have (on average 1.15) internal successors, (138), 122 states have internal predecessors, (138), 34 states have call successors, (34), 25 states have call predecessors, (34), 24 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 15:07:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2025-02-05 15:07:37,278 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 57 [2025-02-05 15:07:37,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:37,278 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2025-02-05 15:07:37,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-05 15:07:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2025-02-05 15:07:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 15:07:37,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:37,279 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:37,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:37,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:37,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:37,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:37,485 INFO L85 PathProgramCache]: Analyzing trace with hash 337331480, now seen corresponding path program 1 times [2025-02-05 15:07:37,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:37,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162956614] [2025-02-05 15:07:37,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:37,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:37,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 15:07:37,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 15:07:37,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:37,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 15:07:37,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:37,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162956614] [2025-02-05 15:07:37,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162956614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:37,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044285670] [2025-02-05 15:07:37,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:07:37,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:37,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:37,642 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:37,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:07:37,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 15:07:37,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 15:07:37,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:37,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:37,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:07:37,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 15:07:37,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 15:07:37,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044285670] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:37,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:07:37,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2025-02-05 15:07:37,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476693870] [2025-02-05 15:07:37,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:37,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:07:37,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:37,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:07:37,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:07:37,794 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 15:07:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:37,888 INFO L93 Difference]: Finished difference Result 205 states and 233 transitions. [2025-02-05 15:07:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:07:37,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 59 [2025-02-05 15:07:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:37,889 INFO L225 Difference]: With dead ends: 205 [2025-02-05 15:07:37,889 INFO L226 Difference]: Without dead ends: 185 [2025-02-05 15:07:37,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:07:37,890 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:37,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 178 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:07:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-05 15:07:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-02-05 15:07:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.1129032258064515) internal successors, (138), 128 states have internal predecessors, (138), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 15:07:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2025-02-05 15:07:37,909 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 59 [2025-02-05 15:07:37,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:37,910 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2025-02-05 15:07:37,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 15:07:37,910 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2025-02-05 15:07:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 15:07:37,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:37,911 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:37,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:38,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 15:07:38,112 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:38,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:38,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1373699756, now seen corresponding path program 2 times [2025-02-05 15:07:38,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:38,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346814758] [2025-02-05 15:07:38,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:07:38,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:38,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-05 15:07:38,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 15:07:38,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:07:38,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-05 15:07:38,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:38,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346814758] [2025-02-05 15:07:38,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346814758] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:38,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892731091] [2025-02-05 15:07:38,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:07:38,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:38,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:38,288 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:38,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:07:38,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-05 15:07:38,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 15:07:38,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:07:38,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:38,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:07:38,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:07:38,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-05 15:07:38,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892731091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:38,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:07:38,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-02-05 15:07:38,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564626276] [2025-02-05 15:07:38,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:38,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 15:07:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:38,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 15:07:38,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:07:38,575 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 12 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2025-02-05 15:07:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:38,834 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2025-02-05 15:07:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 15:07:38,834 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 12 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) Word has length 95 [2025-02-05 15:07:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:38,837 INFO L225 Difference]: With dead ends: 512 [2025-02-05 15:07:38,837 INFO L226 Difference]: Without dead ends: 503 [2025-02-05 15:07:38,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 183 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-05 15:07:38,839 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 61 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:38,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 150 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:07:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-05 15:07:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-02-05 15:07:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 334 states have (on average 1.095808383233533) internal successors, (366), 344 states have internal predecessors, (366), 102 states have call successors, (102), 66 states have call predecessors, (102), 66 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 15:07:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2025-02-05 15:07:38,928 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2025-02-05 15:07:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:38,929 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2025-02-05 15:07:38,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 12 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2025-02-05 15:07:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2025-02-05 15:07:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 15:07:38,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:38,933 INFO L218 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:38,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:39,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 15:07:39,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:39,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:39,135 INFO L85 PathProgramCache]: Analyzing trace with hash -822274580, now seen corresponding path program 3 times [2025-02-05 15:07:39,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:39,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362355833] [2025-02-05 15:07:39,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:07:39,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:39,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 209 statements into 22 equivalence classes. [2025-02-05 15:07:39,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 194 of 209 statements. [2025-02-05 15:07:39,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-02-05 15:07:39,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2025-02-05 15:07:39,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:07:39,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362355833] [2025-02-05 15:07:39,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362355833] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:07:39,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368251200] [2025-02-05 15:07:39,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:07:39,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:39,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:39,932 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:39,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:07:39,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 209 statements into 22 equivalence classes. [2025-02-05 15:07:40,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 194 of 209 statements. [2025-02-05 15:07:40,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-02-05 15:07:40,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:07:40,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 15:07:40,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:07:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 15:07:40,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:07:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2025-02-05 15:07:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368251200] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:07:40,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:07:40,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 14] total 41 [2025-02-05 15:07:40,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523631686] [2025-02-05 15:07:40,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:07:40,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-05 15:07:40,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:07:40,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-05 15:07:40,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 15:07:40,776 INFO L87 Difference]: Start difference. First operand 503 states and 568 transitions. Second operand has 41 states, 41 states have (on average 4.073170731707317) internal successors, (167), 41 states have internal predecessors, (167), 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-05 15:07:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:07:41,517 INFO L93 Difference]: Finished difference Result 1042 states and 1217 transitions. [2025-02-05 15:07:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-05 15:07:41,518 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.073170731707317) internal successors, (167), 41 states have internal predecessors, (167), 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 209 [2025-02-05 15:07:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:07:41,522 INFO L225 Difference]: With dead ends: 1042 [2025-02-05 15:07:41,522 INFO L226 Difference]: Without dead ends: 1033 [2025-02-05 15:07:41,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 395 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1105, Invalid=2435, Unknown=0, NotChecked=0, Total=3540 [2025-02-05 15:07:41,524 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 220 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:07:41,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 365 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:07:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-02-05 15:07:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2025-02-05 15:07:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 684 states have (on average 1.090643274853801) internal successors, (746), 704 states have internal predecessors, (746), 212 states have call successors, (212), 136 states have call predecessors, (212), 136 states have return successors, (210), 192 states have call predecessors, (210), 210 states have call successors, (210) [2025-02-05 15:07:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1168 transitions. [2025-02-05 15:07:41,628 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1168 transitions. Word has length 209 [2025-02-05 15:07:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:07:41,628 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1168 transitions. [2025-02-05 15:07:41,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.073170731707317) internal successors, (167), 41 states have internal predecessors, (167), 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-05 15:07:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1168 transitions. [2025-02-05 15:07:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-02-05 15:07:41,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:07:41,634 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, 1] [2025-02-05 15:07:41,640 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-05 15:07:41,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:41,838 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:07:41,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:07:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1082457260, now seen corresponding path program 4 times [2025-02-05 15:07:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:07:41,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522582511] [2025-02-05 15:07:41,839 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:07:41,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:07:41,851 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 399 statements into 2 equivalence classes. [2025-02-05 15:07:41,927 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 399 of 399 statements. [2025-02-05 15:07:41,929 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:07:41,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:07:41,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399563116] [2025-02-05 15:07:41,932 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:07:41,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:41,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:07:41,934 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:07:41,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:07:41,984 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 399 statements into 2 equivalence classes. [2025-02-05 15:07:42,060 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 399 of 399 statements. [2025-02-05 15:07:42,060 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:07:42,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:07:42,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:07:42,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-02-05 15:07:42,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-02-05 15:07:42,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:07:42,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:07:42,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:07:42,229 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:07:42,230 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:07:42,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-05 15:07:42,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:07:42,434 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:07:42,505 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:07:42,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:07:42 BoogieIcfgContainer [2025-02-05 15:07:42,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:07:42,508 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:07:42,508 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:07:42,508 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:07:42,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:07:32" (3/4) ... [2025-02-05 15:07:42,509 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:07:42,592 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 271. [2025-02-05 15:07:42,693 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:07:42,694 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:07:42,694 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:07:42,694 INFO L158 Benchmark]: Toolchain (without parser) took 11039.42ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 124.1MB in the beginning and 131.4MB in the end (delta: -7.3MB). Peak memory consumption was 181.0MB. Max. memory is 16.1GB. [2025-02-05 15:07:42,695 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:07:42,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.59ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 112.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:07:42,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.02ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 111.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:07:42,695 INFO L158 Benchmark]: Boogie Preprocessor took 16.31ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 110.7MB in the end (delta: 584.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:07:42,695 INFO L158 Benchmark]: IcfgBuilder took 204.80ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 98.2MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:07:42,695 INFO L158 Benchmark]: TraceAbstraction took 10450.18ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 97.6MB in the beginning and 156.5MB in the end (delta: -58.9MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. [2025-02-05 15:07:42,695 INFO L158 Benchmark]: Witness Printer took 185.90ms. Allocated memory is still 360.7MB. Free memory was 156.5MB in the beginning and 131.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 15:07:42,696 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.40ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.59ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 112.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.02ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 111.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.31ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 110.7MB in the end (delta: 584.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 204.80ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 98.2MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10450.18ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 97.6MB in the beginning and 156.5MB in the end (delta: -58.9MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. * Witness Printer took 185.90ms. Allocated memory is still 360.7MB. Free memory was 156.5MB in the beginning and 131.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 15, TraceHistogramMax: 61, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 2252 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1792 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1076 IncrementalHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 460 mSDtfsCounter, 1076 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1266 GetRequests, 1096 SyntacticMatches, 6 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1033occurred in iteration=14, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 71 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2190 NumberOfCodeBlocks, 2160 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 1657 ConstructedInterpolants, 0 QuantifiedInterpolants, 4327 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1733 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 5196/8250 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 15:07:42,712 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