./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.recount4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash d1f3c30f17cc68a40d1b0b31634de48071c9ae3c0808bd553c6c6ce86d938069 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:52:05,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:52:05,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 19:52:05,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:52:05,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:52:05,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:52:05,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:52:05,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:52:05,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:52:05,459 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:52:05,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:52:05,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:52:05,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:52:05,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:52:05,460 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:52:05,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:52:05,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:52:05,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 19:52:05,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:52:05,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:52:05,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:52:05,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:52:05,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:52:05,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:52:05,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:52:05,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:52:05,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:52:05,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:52:05,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:52:05,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:52:05,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:52:05,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:52:05,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:52:05,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:52:05,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 19:52:05,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 19:52:05,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:52:05,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:52:05,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:52:05,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:52:05,463 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d1f3c30f17cc68a40d1b0b31634de48071c9ae3c0808bd553c6c6ce86d938069 [2025-02-05 19:52:05,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:52:05,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:52:05,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:52:05,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:52:05,790 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:52:05,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c [2025-02-05 19:52:07,113 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18fd93d11/8f7e3f29db584d9d845da526c837a7aa/FLAG342521b2c [2025-02-05 19:52:07,367 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:52:07,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c [2025-02-05 19:52:07,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18fd93d11/8f7e3f29db584d9d845da526c837a7aa/FLAG342521b2c [2025-02-05 19:52:07,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18fd93d11/8f7e3f29db584d9d845da526c837a7aa [2025-02-05 19:52:07,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:52:07,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:52:07,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:52:07,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:52:07,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:52:07,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a43a104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07, skipping insertion in model container [2025-02-05 19:52:07,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:52:07,558 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/hardware-verification-bv/btor2c-lazyMod.recount4.c[1258,1271] [2025-02-05 19:52:07,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:52:07,605 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:52:07,615 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/hardware-verification-bv/btor2c-lazyMod.recount4.c[1258,1271] [2025-02-05 19:52:07,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:52:07,654 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:52:07,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07 WrapperNode [2025-02-05 19:52:07,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:52:07,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:52:07,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:52:07,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:52:07,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,707 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2025-02-05 19:52:07,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:52:07,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:52:07,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:52:07,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:52:07,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,747 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 19:52:07,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:52:07,772 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:52:07,772 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:52:07,773 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:52:07,773 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (1/1) ... [2025-02-05 19:52:07,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:52:07,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:52:07,801 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 19:52:07,803 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 19:52:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:52:07,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 19:52:07,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:52:07,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:52:07,881 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:52:07,884 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:52:08,135 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-02-05 19:52:08,135 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:52:08,156 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:52:08,159 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 19:52:08,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:52:08 BoogieIcfgContainer [2025-02-05 19:52:08,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:52:08,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:52:08,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:52:08,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:52:08,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:52:07" (1/3) ... [2025-02-05 19:52:08,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55229895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:52:08, skipping insertion in model container [2025-02-05 19:52:08,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:52:07" (2/3) ... [2025-02-05 19:52:08,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55229895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:52:08, skipping insertion in model container [2025-02-05 19:52:08,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:52:08" (3/3) ... [2025-02-05 19:52:08,169 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.recount4.c [2025-02-05 19:52:08,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:52:08,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.recount4.c that has 1 procedures, 26 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:52:08,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:52:08,252 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;@39d7964c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:52:08,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:52:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 19:52:08,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:52:08,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:52:08,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:52:08,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:52:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1216353189, now seen corresponding path program 1 times [2025-02-05 19:52:08,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:52:08,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328288333] [2025-02-05 19:52:08,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:08,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:52:08,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 19:52:08,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 19:52:08,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:08,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:08,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:52:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328288333] [2025-02-05 19:52:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328288333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:52:08,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:52:08,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:52:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057828954] [2025-02-05 19:52:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:52:08,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:52:08,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:52:08,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:52:08,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:52:08,827 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:52:08,915 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2025-02-05 19:52:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:52:08,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-05 19:52:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:52:08,923 INFO L225 Difference]: With dead ends: 54 [2025-02-05 19:52:08,923 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 19:52:08,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:52:08,930 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 53 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:52:08,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 68 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:52:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 19:52:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-02-05 19:52:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2025-02-05 19:52:08,962 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 11 [2025-02-05 19:52:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:52:08,962 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-02-05 19:52:08,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2025-02-05 19:52:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 19:52:08,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:52:08,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:52:08,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 19:52:08,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:52:08,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:52:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash 761106115, now seen corresponding path program 1 times [2025-02-05 19:52:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:52:08,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186795917] [2025-02-05 19:52:08,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:52:08,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 19:52:09,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 19:52:09,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:09,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:52:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186795917] [2025-02-05 19:52:09,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186795917] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:52:09,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470520788] [2025-02-05 19:52:09,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:09,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:52:09,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:52:09,344 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 19:52:09,346 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 19:52:09,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 19:52:09,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 19:52:09,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:09,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:09,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-05 19:52:09,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:52:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:09,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:52:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:09,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470520788] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:52:09,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 19:52:09,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2025-02-05 19:52:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245748868] [2025-02-05 19:52:09,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 19:52:09,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 19:52:09,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:52:09,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 19:52:09,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-05 19:52:09,965 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:52:10,118 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2025-02-05 19:52:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:52:10,120 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 19:52:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:52:10,120 INFO L225 Difference]: With dead ends: 47 [2025-02-05 19:52:10,120 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 19:52:10,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-02-05 19:52:10,121 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 70 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:52:10,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 225 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:52:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 19:52:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2025-02-05 19:52:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-02-05 19:52:10,130 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 20 [2025-02-05 19:52:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:52:10,131 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-02-05 19:52:10,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-02-05 19:52:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 19:52:10,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:52:10,132 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:52:10,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 19:52:10,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:52:10,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:52:10,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:52:10,338 INFO L85 PathProgramCache]: Analyzing trace with hash 517805003, now seen corresponding path program 1 times [2025-02-05 19:52:10,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:52:10,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685153176] [2025-02-05 19:52:10,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:52:10,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 19:52:10,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 19:52:10,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:10,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:52:10,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685153176] [2025-02-05 19:52:10,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685153176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:52:10,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:52:10,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:52:10,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455993511] [2025-02-05 19:52:10,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:52:10,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:52:10,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:52:10,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:52:10,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:52:10,784 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:52:10,947 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2025-02-05 19:52:10,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:52:10,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 19:52:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:52:10,949 INFO L225 Difference]: With dead ends: 84 [2025-02-05 19:52:10,950 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 19:52:10,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-05 19:52:10,951 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 80 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:52:10,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 60 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:52:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 19:52:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2025-02-05 19:52:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2025-02-05 19:52:10,962 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 21 [2025-02-05 19:52:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:52:10,962 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2025-02-05 19:52:10,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2025-02-05 19:52:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 19:52:10,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:52:10,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:52:10,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 19:52:10,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:52:10,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:52:10,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1588225610, now seen corresponding path program 1 times [2025-02-05 19:52:10,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:52:10,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761351619] [2025-02-05 19:52:10,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:10,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:52:10,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 19:52:10,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 19:52:10,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:10,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:11,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:52:11,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761351619] [2025-02-05 19:52:11,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761351619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:52:11,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:52:11,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 19:52:11,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881720490] [2025-02-05 19:52:11,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:52:11,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:52:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:52:11,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:52:11,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:52:11,512 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:52:11,772 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2025-02-05 19:52:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:52:11,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 19:52:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:52:11,773 INFO L225 Difference]: With dead ends: 94 [2025-02-05 19:52:11,773 INFO L226 Difference]: Without dead ends: 66 [2025-02-05 19:52:11,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-05 19:52:11,774 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 72 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:52:11,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 79 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:52:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-05 19:52:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2025-02-05 19:52:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2025-02-05 19:52:11,780 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 22 [2025-02-05 19:52:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:52:11,780 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2025-02-05 19:52:11,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2025-02-05 19:52:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 19:52:11,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:52:11,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:52:11,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 19:52:11,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:52:11,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:52:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash 137881354, now seen corresponding path program 1 times [2025-02-05 19:52:11,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:52:11,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4261248] [2025-02-05 19:52:11,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:11,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:52:11,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 19:52:11,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 19:52:11,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:11,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:12,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:52:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4261248] [2025-02-05 19:52:12,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4261248] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:52:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49646494] [2025-02-05 19:52:12,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:12,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:52:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:52:12,533 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 19:52:12,536 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 19:52:12,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 19:52:12,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 19:52:12,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:12,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:12,651 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-05 19:52:12,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:52:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:13,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:52:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:16,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49646494] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:52:16,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 19:52:16,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 36 [2025-02-05 19:52:16,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211513229] [2025-02-05 19:52:16,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 19:52:16,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 19:52:16,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:52:16,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 19:52:16,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 19:52:16,459 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:52:17,501 INFO L93 Difference]: Finished difference Result 135 states and 184 transitions. [2025-02-05 19:52:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 19:52:17,501 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 19:52:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:52:17,503 INFO L225 Difference]: With dead ends: 135 [2025-02-05 19:52:17,503 INFO L226 Difference]: Without dead ends: 107 [2025-02-05 19:52:17,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=492, Invalid=2588, Unknown=0, NotChecked=0, Total=3080 [2025-02-05 19:52:17,506 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 269 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:52:17,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 64 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:52:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-05 19:52:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2025-02-05 19:52:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2025-02-05 19:52:17,519 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 23 [2025-02-05 19:52:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:52:17,519 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2025-02-05 19:52:17,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2025-02-05 19:52:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 19:52:17,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:52:17,520 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:52:17,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 19:52:17,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:52:17,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:52:17,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:52:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash -599935439, now seen corresponding path program 1 times [2025-02-05 19:52:17,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:52:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942084844] [2025-02-05 19:52:17,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:52:17,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 19:52:17,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 19:52:17,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:17,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 19:52:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:52:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942084844] [2025-02-05 19:52:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942084844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:52:18,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:52:18,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:52:18,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726099299] [2025-02-05 19:52:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:52:18,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:52:18,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:52:18,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:52:18,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:52:18,154 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:52:18,238 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2025-02-05 19:52:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:52:18,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-05 19:52:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:52:18,239 INFO L225 Difference]: With dead ends: 143 [2025-02-05 19:52:18,240 INFO L226 Difference]: Without dead ends: 100 [2025-02-05 19:52:18,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:52:18,241 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:52:18,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 173 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:52:18,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-05 19:52:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2025-02-05 19:52:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2025-02-05 19:52:18,246 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 41 [2025-02-05 19:52:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:52:18,246 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2025-02-05 19:52:18,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2025-02-05 19:52:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 19:52:18,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:52:18,247 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:52:18,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 19:52:18,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:52:18,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:52:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash 983095207, now seen corresponding path program 1 times [2025-02-05 19:52:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:52:18,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414965509] [2025-02-05 19:52:18,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:18,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:52:18,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 19:52:18,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 19:52:18,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:18,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 19:52:18,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:52:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414965509] [2025-02-05 19:52:18,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414965509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:52:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69155911] [2025-02-05 19:52:18,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:18,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:52:18,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:52:18,516 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 19:52:18,518 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 19:52:18,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 19:52:18,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 19:52:18,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:18,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:18,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 19:52:18,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:52:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 19:52:18,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:52:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 19:52:19,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69155911] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:52:19,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 19:52:19,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-02-05 19:52:19,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191645061] [2025-02-05 19:52:19,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 19:52:19,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 19:52:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:52:19,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 19:52:19,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-05 19:52:19,188 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:52:19,372 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2025-02-05 19:52:19,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:52:19,373 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-05 19:52:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:52:19,375 INFO L225 Difference]: With dead ends: 156 [2025-02-05 19:52:19,375 INFO L226 Difference]: Without dead ends: 102 [2025-02-05 19:52:19,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-02-05 19:52:19,376 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:52:19,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 62 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:52:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-05 19:52:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2025-02-05 19:52:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2025-02-05 19:52:19,384 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 42 [2025-02-05 19:52:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:52:19,384 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2025-02-05 19:52:19,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2025-02-05 19:52:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 19:52:19,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:52:19,387 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:52:19,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 19:52:19,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:52:19,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:52:19,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:52:19,588 INFO L85 PathProgramCache]: Analyzing trace with hash -554097630, now seen corresponding path program 1 times [2025-02-05 19:52:19,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:52:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045454548] [2025-02-05 19:52:19,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:52:19,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 19:52:19,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 19:52:19,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:20,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:52:20,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045454548] [2025-02-05 19:52:20,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045454548] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:52:20,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759835592] [2025-02-05 19:52:20,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:20,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:52:20,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:52:20,565 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 19:52:20,567 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 19:52:20,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 19:52:20,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 19:52:20,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:20,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:20,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-05 19:52:20,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:52:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 19:52:21,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:52:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 19:52:21,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759835592] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:52:21,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 19:52:21,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 34 [2025-02-05 19:52:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616959483] [2025-02-05 19:52:21,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 19:52:21,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 19:52:21,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:52:21,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 19:52:21,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 19:52:21,868 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand has 34 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:52:22,920 INFO L93 Difference]: Finished difference Result 258 states and 335 transitions. [2025-02-05 19:52:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 19:52:22,921 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-05 19:52:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:52:22,922 INFO L225 Difference]: With dead ends: 258 [2025-02-05 19:52:22,922 INFO L226 Difference]: Without dead ends: 207 [2025-02-05 19:52:22,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=697, Invalid=3209, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 19:52:22,925 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 252 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:52:22,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 80 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:52:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-05 19:52:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 131. [2025-02-05 19:52:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 176 transitions. [2025-02-05 19:52:22,944 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 176 transitions. Word has length 42 [2025-02-05 19:52:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:52:22,944 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 176 transitions. [2025-02-05 19:52:22,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 176 transitions. [2025-02-05 19:52:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 19:52:22,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:52:22,945 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:52:22,961 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 19:52:23,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 19:52:23,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:52:23,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:52:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1298561885, now seen corresponding path program 1 times [2025-02-05 19:52:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:52:23,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204530705] [2025-02-05 19:52:23,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:23,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:52:23,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 19:52:23,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 19:52:23,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:23,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:24,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:52:24,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204530705] [2025-02-05 19:52:24,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204530705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:52:24,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624491389] [2025-02-05 19:52:24,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:24,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:52:24,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:52:24,415 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 19:52:24,417 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 19:52:24,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 19:52:24,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 19:52:24,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:24,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:24,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-05 19:52:24,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:52:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:25,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:52:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:27,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624491389] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:52:27,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 19:52:27,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 56 [2025-02-05 19:52:27,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440311408] [2025-02-05 19:52:27,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 19:52:27,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-05 19:52:27,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:52:27,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-05 19:52:27,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=2707, Unknown=0, NotChecked=0, Total=3080 [2025-02-05 19:52:27,378 INFO L87 Difference]: Start difference. First operand 131 states and 176 transitions. Second operand has 56 states, 56 states have (on average 2.267857142857143) internal successors, (127), 56 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:52:30,425 INFO L93 Difference]: Finished difference Result 248 states and 318 transitions. [2025-02-05 19:52:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-02-05 19:52:30,425 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.267857142857143) internal successors, (127), 56 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-05 19:52:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:52:30,426 INFO L225 Difference]: With dead ends: 248 [2025-02-05 19:52:30,426 INFO L226 Difference]: Without dead ends: 246 [2025-02-05 19:52:30,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3905 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2121, Invalid=11219, Unknown=0, NotChecked=0, Total=13340 [2025-02-05 19:52:30,430 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 554 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:52:30,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 77 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:52:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-05 19:52:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 94. [2025-02-05 19:52:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2025-02-05 19:52:30,442 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 44 [2025-02-05 19:52:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:52:30,442 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2025-02-05 19:52:30,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.267857142857143) internal successors, (127), 56 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:52:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2025-02-05 19:52:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 19:52:30,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:52:30,444 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:52:30,452 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 19:52:30,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:52:30,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:52:30,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:52:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1618892628, now seen corresponding path program 1 times [2025-02-05 19:52:30,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:52:30,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403140129] [2025-02-05 19:52:30,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:30,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:52:30,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 19:52:30,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 19:52:30,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:30,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:32,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:52:32,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403140129] [2025-02-05 19:52:32,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403140129] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:52:32,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496336939] [2025-02-05 19:52:32,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:52:32,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:52:32,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:52:32,278 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 19:52:32,280 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 19:52:32,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 19:52:32,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 19:52:32,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:52:32,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:52:32,399 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-02-05 19:52:32,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:52:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:52:33,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:52:56,505 WARN L286 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 174 DAG size of output: 159 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)