./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.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.twocount2c.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 ae56bcfc435405d456e1dc5e8920e6da28d699f35561354769dbf7e31b8f91d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:07:47,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:07:47,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:07:47,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:07:47,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:07:47,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:07:47,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:07:47,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:07:47,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:07:47,495 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:07:47,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:07:47,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:07:47,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:07:47,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:07:47,497 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:07:47,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:07:47,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:07:47,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:07:47,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:07:47,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:07:47,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:07:47,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:07:47,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:07:47,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:07:47,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:07:47,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:07:47,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:07:47,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:07:47,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:07:47,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:07:47,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:07:47,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:07:47,499 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:07:47,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:07:47,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:07:47,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:07:47,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:07:47,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:07:47,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:07:47,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:07:47,500 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 -> ae56bcfc435405d456e1dc5e8920e6da28d699f35561354769dbf7e31b8f91d6 [2025-02-05 20:07:47,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:07:47,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:07:47,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:07:47,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:07:47,794 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:07:47,796 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.twocount2c.c [2025-02-05 20:07:49,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5216defc/05993162532f4e128f2238429ec971aa/FLAG53fe1bd93 [2025-02-05 20:07:49,402 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:07:49,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2025-02-05 20:07:49,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5216defc/05993162532f4e128f2238429ec971aa/FLAG53fe1bd93 [2025-02-05 20:07:49,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5216defc/05993162532f4e128f2238429ec971aa [2025-02-05 20:07:49,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:07:49,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:07:49,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:07:49,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:07:49,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:07:49,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19014b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49, skipping insertion in model container [2025-02-05 20:07:49,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:07:49,596 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.twocount2c.c[1260,1273] [2025-02-05 20:07:49,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:07:49,644 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:07:49,653 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.twocount2c.c[1260,1273] [2025-02-05 20:07:49,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:07:49,695 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:07:49,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49 WrapperNode [2025-02-05 20:07:49,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:07:49,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:07:49,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:07:49,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:07:49,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,759 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2025-02-05 20:07:49,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:07:49,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:07:49,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:07:49,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:07:49,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,786 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 20:07:49,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:07:49,813 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:07:49,814 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:07:49,814 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:07:49,814 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (1/1) ... [2025-02-05 20:07:49,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:07:49,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:07:49,850 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 20:07:49,853 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 20:07:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:07:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:07:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:07:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:07:49,942 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:07:49,944 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:07:50,308 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-02-05 20:07:50,308 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:07:50,333 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:07:50,334 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:07:50,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:07:50 BoogieIcfgContainer [2025-02-05 20:07:50,334 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:07:50,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:07:50,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:07:50,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:07:50,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:07:49" (1/3) ... [2025-02-05 20:07:50,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fef19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:07:50, skipping insertion in model container [2025-02-05 20:07:50,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:07:49" (2/3) ... [2025-02-05 20:07:50,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fef19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:07:50, skipping insertion in model container [2025-02-05 20:07:50,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:07:50" (3/3) ... [2025-02-05 20:07:50,345 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2c.c [2025-02-05 20:07:50,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:07:50,359 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.twocount2c.c that has 1 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:07:50,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:07:50,410 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;@326a0fbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:07:50,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:07:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 50 states have (on average 1.48) internal successors, (74), 51 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 20:07:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 20:07:50,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:50,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:50,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:50,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash -413886595, now seen corresponding path program 1 times [2025-02-05 20:07:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:50,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657269843] [2025-02-05 20:07:50,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:50,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 20:07:50,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 20:07:50,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:50,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:50,628 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 20:07:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:50,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657269843] [2025-02-05 20:07:50,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657269843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:50,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:50,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:07:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528394454] [2025-02-05 20:07:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:50,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:07:50,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:50,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:07:50,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:07:50,659 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.48) internal successors, (74), 51 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) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 20:07:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:50,698 INFO L93 Difference]: Finished difference Result 91 states and 132 transitions. [2025-02-05 20:07:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:07:50,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 20:07:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:50,706 INFO L225 Difference]: With dead ends: 91 [2025-02-05 20:07:50,706 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 20:07:50,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:07:50,710 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:50,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:07:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 20:07:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-05 20:07:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 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 20:07:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-02-05 20:07:50,735 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 23 [2025-02-05 20:07:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:50,736 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-02-05 20:07:50,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 20:07:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-02-05 20:07:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 20:07:50,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:50,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:50,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:07:50,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:50,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:50,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1328923740, now seen corresponding path program 1 times [2025-02-05 20:07:50,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:50,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595984962] [2025-02-05 20:07:50,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:50,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:50,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 20:07:50,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 20:07:50,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:50,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:51,160 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 20:07:51,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:51,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595984962] [2025-02-05 20:07:51,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595984962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:51,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:51,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:07:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626231686] [2025-02-05 20:07:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:51,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:07:51,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:51,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:07:51,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:07:51,168 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 20:07:51,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:51,285 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2025-02-05 20:07:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:07:51,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 20:07:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:51,288 INFO L225 Difference]: With dead ends: 92 [2025-02-05 20:07:51,288 INFO L226 Difference]: Without dead ends: 53 [2025-02-05 20:07:51,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:07:51,289 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 60 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:51,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 122 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:07:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-05 20:07:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-02-05 20:07:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 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 20:07:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2025-02-05 20:07:51,300 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 23 [2025-02-05 20:07:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:51,301 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2025-02-05 20:07:51,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 20:07:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2025-02-05 20:07:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 20:07:51,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:51,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:51,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:07:51,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:51,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1687216649, now seen corresponding path program 1 times [2025-02-05 20:07:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:51,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013175825] [2025-02-05 20:07:51,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:51,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 20:07:51,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 20:07:51,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:51,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:51,473 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 20:07:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:51,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013175825] [2025-02-05 20:07:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013175825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:51,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:51,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:07:51,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552911005] [2025-02-05 20:07:51,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:51,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:07:51,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:51,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:07:51,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:07:51,478 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 20:07:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:51,583 INFO L93 Difference]: Finished difference Result 119 states and 162 transitions. [2025-02-05 20:07:51,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:07:51,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2025-02-05 20:07:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:51,586 INFO L225 Difference]: With dead ends: 119 [2025-02-05 20:07:51,587 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 20:07:51,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:07:51,588 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:51,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 258 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:07:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 20:07:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2025-02-05 20:07:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 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 20:07:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2025-02-05 20:07:51,595 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 24 [2025-02-05 20:07:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:51,595 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2025-02-05 20:07:51,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 20:07:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2025-02-05 20:07:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 20:07:51,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:51,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:51,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:07:51,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash 157810994, now seen corresponding path program 1 times [2025-02-05 20:07:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038385042] [2025-02-05 20:07:51,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:51,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 20:07:51,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 20:07:51,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:51,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:51,751 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 20:07:51,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:51,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038385042] [2025-02-05 20:07:51,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038385042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:51,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:51,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:07:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561256802] [2025-02-05 20:07:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:51,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:07:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:51,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:07:51,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:07:51,754 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 20:07:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:51,818 INFO L93 Difference]: Finished difference Result 110 states and 151 transitions. [2025-02-05 20:07:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:07:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2025-02-05 20:07:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:51,819 INFO L225 Difference]: With dead ends: 110 [2025-02-05 20:07:51,821 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 20:07:51,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:07:51,822 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:51,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:07:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 20:07:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-02-05 20:07:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 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 20:07:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2025-02-05 20:07:51,829 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 25 [2025-02-05 20:07:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:51,830 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2025-02-05 20:07:51,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 20:07:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2025-02-05 20:07:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 20:07:51,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:51,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:51,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:07:51,831 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1970442216, now seen corresponding path program 1 times [2025-02-05 20:07:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412944075] [2025-02-05 20:07:51,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:51,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 20:07:51,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 20:07:51,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:51,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:52,012 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 20:07:52,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:52,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412944075] [2025-02-05 20:07:52,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412944075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:52,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:52,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:07:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096325691] [2025-02-05 20:07:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:52,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:07:52,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:52,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:07:52,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:07:52,014 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 20:07:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:52,051 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2025-02-05 20:07:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:07:52,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2025-02-05 20:07:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:52,052 INFO L225 Difference]: With dead ends: 62 [2025-02-05 20:07:52,052 INFO L226 Difference]: Without dead ends: 60 [2025-02-05 20:07:52,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:07:52,054 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:52,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:07:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-05 20:07:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-05 20:07:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 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 20:07:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2025-02-05 20:07:52,064 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 25 [2025-02-05 20:07:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:52,065 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2025-02-05 20:07:52,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 20:07:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2025-02-05 20:07:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 20:07:52,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:52,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:52,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:07:52,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:52,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash 958845711, now seen corresponding path program 1 times [2025-02-05 20:07:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:52,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914955749] [2025-02-05 20:07:52,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:52,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:52,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 20:07:52,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 20:07:52,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:52,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:52,171 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 20:07:52,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:52,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914955749] [2025-02-05 20:07:52,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914955749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:52,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:52,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:07:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45798904] [2025-02-05 20:07:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:52,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:07:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:52,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:07:52,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:07:52,175 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 20:07:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:52,216 INFO L93 Difference]: Finished difference Result 112 states and 153 transitions. [2025-02-05 20:07:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:07:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2025-02-05 20:07:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:52,218 INFO L225 Difference]: With dead ends: 112 [2025-02-05 20:07:52,218 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 20:07:52,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:07:52,220 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:52,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:07:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 20:07:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-05 20:07:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 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 20:07:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2025-02-05 20:07:52,228 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 26 [2025-02-05 20:07:52,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:52,229 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2025-02-05 20:07:52,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 20:07:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2025-02-05 20:07:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 20:07:52,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:52,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:52,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:07:52,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:52,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1590955203, now seen corresponding path program 1 times [2025-02-05 20:07:52,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:52,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103033269] [2025-02-05 20:07:52,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:52,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:52,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 20:07:52,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 20:07:52,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:52,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:52,594 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 20:07:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103033269] [2025-02-05 20:07:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103033269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:52,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:07:52,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886774407] [2025-02-05 20:07:52,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:52,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:07:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:52,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:07:52,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:07:52,595 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 20:07:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:52,759 INFO L93 Difference]: Finished difference Result 152 states and 205 transitions. [2025-02-05 20:07:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:07:52,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 27 [2025-02-05 20:07:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:52,760 INFO L225 Difference]: With dead ends: 152 [2025-02-05 20:07:52,760 INFO L226 Difference]: Without dead ends: 100 [2025-02-05 20:07:52,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:07:52,761 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 43 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:52,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 255 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:07:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-05 20:07:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2025-02-05 20:07:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 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 20:07:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2025-02-05 20:07:52,770 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 27 [2025-02-05 20:07:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:52,771 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2025-02-05 20:07:52,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 20:07:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2025-02-05 20:07:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 20:07:52,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:52,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:52,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:07:52,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:52,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash 750184126, now seen corresponding path program 1 times [2025-02-05 20:07:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:52,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875991108] [2025-02-05 20:07:52,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:52,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 20:07:52,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 20:07:52,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:52,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:07:53,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:53,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875991108] [2025-02-05 20:07:53,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875991108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:07:53,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52896164] [2025-02-05 20:07:53,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:53,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:07:53,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:07:53,296 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 20:07:53,298 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 20:07:53,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 20:07:53,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 20:07:53,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:53,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:53,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-05 20:07:53,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:07:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:07:53,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:07:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:07:54,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52896164] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:07:54,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:07:54,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2025-02-05 20:07:54,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774167776] [2025-02-05 20:07:54,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:07:54,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 20:07:54,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:54,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 20:07:54,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:07:54,227 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 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 20:07:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:54,825 INFO L93 Difference]: Finished difference Result 262 states and 349 transitions. [2025-02-05 20:07:54,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 20:07:54,825 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 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 50 [2025-02-05 20:07:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:54,827 INFO L225 Difference]: With dead ends: 262 [2025-02-05 20:07:54,827 INFO L226 Difference]: Without dead ends: 210 [2025-02-05 20:07:54,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 20:07:54,828 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 383 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:54,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 313 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:07:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-05 20:07:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 96. [2025-02-05 20:07:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 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 20:07:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2025-02-05 20:07:54,843 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 50 [2025-02-05 20:07:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:54,843 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2025-02-05 20:07:54,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 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 20:07:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2025-02-05 20:07:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 20:07:54,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:54,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:54,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:07:55,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:07:55,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:55,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash 649206499, now seen corresponding path program 1 times [2025-02-05 20:07:55,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:55,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456100983] [2025-02-05 20:07:55,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:55,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 20:07:55,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 20:07:55,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:55,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:07:55,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:55,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456100983] [2025-02-05 20:07:55,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456100983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:55,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:55,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:07:55,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175724550] [2025-02-05 20:07:55,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:55,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:07:55,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:55,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:07:55,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:07:55,430 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 20:07:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:55,556 INFO L93 Difference]: Finished difference Result 243 states and 323 transitions. [2025-02-05 20:07:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:07:55,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 52 [2025-02-05 20:07:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:55,558 INFO L225 Difference]: With dead ends: 243 [2025-02-05 20:07:55,558 INFO L226 Difference]: Without dead ends: 157 [2025-02-05 20:07:55,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:07:55,559 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 48 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:55,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 211 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:07:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-05 20:07:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 124. [2025-02-05 20:07:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.3333333333333333) internal successors, (164), 123 states have internal predecessors, (164), 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 20:07:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2025-02-05 20:07:55,569 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 164 transitions. Word has length 52 [2025-02-05 20:07:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:55,570 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 164 transitions. [2025-02-05 20:07:55,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 20:07:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 164 transitions. [2025-02-05 20:07:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 20:07:55,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:55,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:55,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:07:55,571 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:55,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash 272599581, now seen corresponding path program 1 times [2025-02-05 20:07:55,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:55,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563043396] [2025-02-05 20:07:55,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:55,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:55,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 20:07:55,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 20:07:55,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 20:07:55,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563043396] [2025-02-05 20:07:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563043396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:55,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:07:55,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709230163] [2025-02-05 20:07:55,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:55,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:07:55,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:55,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:07:55,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:07:55,820 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 20:07:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:56,040 INFO L93 Difference]: Finished difference Result 292 states and 383 transitions. [2025-02-05 20:07:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:07:56,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 53 [2025-02-05 20:07:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:56,043 INFO L225 Difference]: With dead ends: 292 [2025-02-05 20:07:56,043 INFO L226 Difference]: Without dead ends: 206 [2025-02-05 20:07:56,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:07:56,044 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 98 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:56,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 285 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:07:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-05 20:07:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 140. [2025-02-05 20:07:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 139 states have internal predecessors, (189), 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 20:07:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2025-02-05 20:07:56,061 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 53 [2025-02-05 20:07:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:56,062 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2025-02-05 20:07:56,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 20:07:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2025-02-05 20:07:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 20:07:56,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:56,063 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:56,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:07:56,063 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:56,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1262358225, now seen corresponding path program 1 times [2025-02-05 20:07:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648226237] [2025-02-05 20:07:56,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:56,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 20:07:56,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 20:07:56,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:56,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:07:56,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:56,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648226237] [2025-02-05 20:07:56,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648226237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:56,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:56,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:07:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52479703] [2025-02-05 20:07:56,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:56,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:07:56,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:56,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:07:56,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:07:56,344 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 20:07:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:56,463 INFO L93 Difference]: Finished difference Result 305 states and 404 transitions. [2025-02-05 20:07:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:07:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-02-05 20:07:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:56,465 INFO L225 Difference]: With dead ends: 305 [2025-02-05 20:07:56,465 INFO L226 Difference]: Without dead ends: 201 [2025-02-05 20:07:56,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:07:56,466 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:56,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 220 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:07:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-05 20:07:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 174. [2025-02-05 20:07:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.2947976878612717) internal successors, (224), 173 states have internal predecessors, (224), 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 20:07:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 224 transitions. [2025-02-05 20:07:56,479 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 224 transitions. Word has length 53 [2025-02-05 20:07:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:56,479 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 224 transitions. [2025-02-05 20:07:56,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 20:07:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 224 transitions. [2025-02-05 20:07:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 20:07:56,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:56,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:56,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:07:56,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:56,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash -194937738, now seen corresponding path program 1 times [2025-02-05 20:07:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67176348] [2025-02-05 20:07:56,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:56,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 20:07:56,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 20:07:56,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:56,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:07:56,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:56,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67176348] [2025-02-05 20:07:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67176348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:56,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:07:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513271874] [2025-02-05 20:07:56,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:56,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:07:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:56,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:07:56,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:07:56,822 INFO L87 Difference]: Start difference. First operand 174 states and 224 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 20:07:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:56,913 INFO L93 Difference]: Finished difference Result 312 states and 414 transitions. [2025-02-05 20:07:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:07:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2025-02-05 20:07:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:56,914 INFO L225 Difference]: With dead ends: 312 [2025-02-05 20:07:56,915 INFO L226 Difference]: Without dead ends: 212 [2025-02-05 20:07:56,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:07:56,915 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:56,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 151 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:07:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-05 20:07:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2025-02-05 20:07:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.3014354066985645) internal successors, (272), 209 states have internal predecessors, (272), 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 20:07:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 272 transitions. [2025-02-05 20:07:56,922 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 272 transitions. Word has length 54 [2025-02-05 20:07:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:56,923 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 272 transitions. [2025-02-05 20:07:56,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 20:07:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 272 transitions. [2025-02-05 20:07:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 20:07:56,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:56,923 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:56,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:07:56,924 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:56,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:56,924 INFO L85 PathProgramCache]: Analyzing trace with hash -816844611, now seen corresponding path program 1 times [2025-02-05 20:07:56,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:56,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294288935] [2025-02-05 20:07:56,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:56,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:56,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 20:07:56,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 20:07:56,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:56,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:07:57,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:57,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294288935] [2025-02-05 20:07:57,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294288935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:57,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:57,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:07:57,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410117888] [2025-02-05 20:07:57,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:57,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:07:57,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:57,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:07:57,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:07:57,252 INFO L87 Difference]: Start difference. First operand 210 states and 272 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 20:07:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:57,340 INFO L93 Difference]: Finished difference Result 315 states and 416 transitions. [2025-02-05 20:07:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:07:57,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2025-02-05 20:07:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:57,342 INFO L225 Difference]: With dead ends: 315 [2025-02-05 20:07:57,342 INFO L226 Difference]: Without dead ends: 210 [2025-02-05 20:07:57,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:07:57,342 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:57,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 157 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:07:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-05 20:07:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-02-05 20:07:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.291866028708134) internal successors, (270), 209 states have internal predecessors, (270), 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 20:07:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 270 transitions. [2025-02-05 20:07:57,349 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 270 transitions. Word has length 55 [2025-02-05 20:07:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:57,349 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 270 transitions. [2025-02-05 20:07:57,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 20:07:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2025-02-05 20:07:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 20:07:57,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:57,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:57,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:07:57,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash 998921621, now seen corresponding path program 1 times [2025-02-05 20:07:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:57,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968995340] [2025-02-05 20:07:57,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:57,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:57,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:07:57,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:07:57,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:57,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 20:07:57,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:57,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968995340] [2025-02-05 20:07:57,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968995340] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:07:57,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841823209] [2025-02-05 20:07:57,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:57,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:07:57,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:07:57,720 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 20:07:57,722 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 20:07:57,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:07:57,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:07:57,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:57,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:57,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 20:07:57,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:07:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 20:07:57,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:07:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841823209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:57,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:07:57,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2025-02-05 20:07:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150595296] [2025-02-05 20:07:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:07:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:57,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:07:57,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:07:57,848 INFO L87 Difference]: Start difference. First operand 210 states and 270 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 20:07:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:57,880 INFO L93 Difference]: Finished difference Result 332 states and 433 transitions. [2025-02-05 20:07:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:07:57,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 56 [2025-02-05 20:07:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:57,881 INFO L225 Difference]: With dead ends: 332 [2025-02-05 20:07:57,881 INFO L226 Difference]: Without dead ends: 210 [2025-02-05 20:07:57,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:07:57,882 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:57,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:07:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-05 20:07:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-02-05 20:07:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.277511961722488) internal successors, (267), 209 states have internal predecessors, (267), 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 20:07:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 267 transitions. [2025-02-05 20:07:57,888 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 267 transitions. Word has length 56 [2025-02-05 20:07:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:57,888 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 267 transitions. [2025-02-05 20:07:57,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 20:07:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2025-02-05 20:07:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 20:07:57,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:57,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:57,896 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 20:07:58,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:07:58,089 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:58,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1967847655, now seen corresponding path program 1 times [2025-02-05 20:07:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:58,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248731947] [2025-02-05 20:07:58,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:58,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:07:58,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:07:58,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:58,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 20:07:58,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:58,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248731947] [2025-02-05 20:07:58,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248731947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:58,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:58,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:07:58,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864711914] [2025-02-05 20:07:58,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:58,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:07:58,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:58,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:07:58,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:07:58,357 INFO L87 Difference]: Start difference. First operand 210 states and 267 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 20:07:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:58,577 INFO L93 Difference]: Finished difference Result 419 states and 528 transitions. [2025-02-05 20:07:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:07:58,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 56 [2025-02-05 20:07:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:58,579 INFO L225 Difference]: With dead ends: 419 [2025-02-05 20:07:58,579 INFO L226 Difference]: Without dead ends: 297 [2025-02-05 20:07:58,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:07:58,580 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 106 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:58,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 240 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:07:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-05 20:07:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 216. [2025-02-05 20:07:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 215 states have internal predecessors, (273), 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 20:07:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 273 transitions. [2025-02-05 20:07:58,590 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 273 transitions. Word has length 56 [2025-02-05 20:07:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:58,590 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 273 transitions. [2025-02-05 20:07:58,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 20:07:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2025-02-05 20:07:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:07:58,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:58,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:58,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:07:58,591 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:58,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1437359841, now seen corresponding path program 1 times [2025-02-05 20:07:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:58,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805673271] [2025-02-05 20:07:58,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:58,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:07:58,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:07:58,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:58,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 20:07:58,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:58,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805673271] [2025-02-05 20:07:58,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805673271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:58,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:58,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:07:58,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971132899] [2025-02-05 20:07:58,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:58,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:07:58,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:58,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:07:58,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:07:58,859 INFO L87 Difference]: Start difference. First operand 216 states and 273 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 20:07:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:59,004 INFO L93 Difference]: Finished difference Result 338 states and 434 transitions. [2025-02-05 20:07:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:07:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 57 [2025-02-05 20:07:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:59,005 INFO L225 Difference]: With dead ends: 338 [2025-02-05 20:07:59,005 INFO L226 Difference]: Without dead ends: 216 [2025-02-05 20:07:59,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:07:59,006 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 82 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:59,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 186 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:07:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-05 20:07:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2025-02-05 20:07:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.2525773195876289) internal successors, (243), 194 states have internal predecessors, (243), 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 20:07:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-02-05 20:07:59,012 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 57 [2025-02-05 20:07:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:59,012 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-02-05 20:07:59,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 20:07:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-02-05 20:07:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:07:59,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:59,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:59,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:07:59,013 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:59,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2142518254, now seen corresponding path program 1 times [2025-02-05 20:07:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:59,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786003800] [2025-02-05 20:07:59,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:59,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:07:59,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:07:59,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:59,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:07:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:07:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:07:59,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786003800] [2025-02-05 20:07:59,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786003800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:07:59,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:07:59,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:07:59,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923561037] [2025-02-05 20:07:59,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:07:59,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:07:59,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:07:59,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:07:59,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:07:59,471 INFO L87 Difference]: Start difference. First operand 195 states and 243 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 20:07:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:07:59,705 INFO L93 Difference]: Finished difference Result 308 states and 390 transitions. [2025-02-05 20:07:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:07:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 57 [2025-02-05 20:07:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:07:59,707 INFO L225 Difference]: With dead ends: 308 [2025-02-05 20:07:59,707 INFO L226 Difference]: Without dead ends: 213 [2025-02-05 20:07:59,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:07:59,708 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:07:59,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 313 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:07:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-05 20:07:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 197. [2025-02-05 20:07:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.2551020408163265) internal successors, (246), 196 states have internal predecessors, (246), 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 20:07:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 246 transitions. [2025-02-05 20:07:59,715 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 246 transitions. Word has length 57 [2025-02-05 20:07:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:07:59,715 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 246 transitions. [2025-02-05 20:07:59,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 20:07:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 246 transitions. [2025-02-05 20:07:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:07:59,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:07:59,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:07:59,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:07:59,716 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:07:59,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:07:59,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1709773296, now seen corresponding path program 1 times [2025-02-05 20:07:59,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:07:59,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624580917] [2025-02-05 20:07:59,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:07:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:07:59,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:07:59,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:07:59,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:07:59,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:00,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:00,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624580917] [2025-02-05 20:08:00,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624580917] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:08:00,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726581325] [2025-02-05 20:08:00,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:00,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:00,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:00,333 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 20:08:00,335 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 20:08:00,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:08:00,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:08:00,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:00,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:00,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-02-05 20:08:00,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:08:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:01,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:08:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726581325] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:08:02,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:08:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 16] total 37 [2025-02-05 20:08:02,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218844785] [2025-02-05 20:08:02,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:08:02,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 20:08:02,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:02,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 20:08:02,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 20:08:02,189 INFO L87 Difference]: Start difference. First operand 197 states and 246 transitions. Second operand has 37 states, 37 states have (on average 4.297297297297297) internal successors, (159), 37 states have internal predecessors, (159), 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 20:08:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:05,101 INFO L93 Difference]: Finished difference Result 685 states and 848 transitions. [2025-02-05 20:08:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-02-05 20:08:05,101 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.297297297297297) internal successors, (159), 37 states have internal predecessors, (159), 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 57 [2025-02-05 20:08:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:05,104 INFO L225 Difference]: With dead ends: 685 [2025-02-05 20:08:05,104 INFO L226 Difference]: Without dead ends: 590 [2025-02-05 20:08:05,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2557 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1139, Invalid=8563, Unknown=0, NotChecked=0, Total=9702 [2025-02-05 20:08:05,109 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 479 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:05,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 578 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:08:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-02-05 20:08:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 262. [2025-02-05 20:08:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.21455938697318) internal successors, (317), 261 states have internal predecessors, (317), 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 20:08:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 317 transitions. [2025-02-05 20:08:05,119 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 317 transitions. Word has length 57 [2025-02-05 20:08:05,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:05,119 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 317 transitions. [2025-02-05 20:08:05,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.297297297297297) internal successors, (159), 37 states have internal predecessors, (159), 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 20:08:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 317 transitions. [2025-02-05 20:08:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 20:08:05,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:05,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:05,129 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 20:08:05,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:05,321 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:05,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1049712839, now seen corresponding path program 1 times [2025-02-05 20:08:05,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:05,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221751391] [2025-02-05 20:08:05,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:05,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:05,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 20:08:05,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 20:08:05,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:05,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:05,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:05,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221751391] [2025-02-05 20:08:05,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221751391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:05,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:05,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:08:05,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598629801] [2025-02-05 20:08:05,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:05,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:08:05,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:05,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:08:05,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:08:05,623 INFO L87 Difference]: Start difference. First operand 262 states and 317 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 20:08:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:05,767 INFO L93 Difference]: Finished difference Result 459 states and 567 transitions. [2025-02-05 20:08:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:08:05,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 76 [2025-02-05 20:08:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:05,769 INFO L225 Difference]: With dead ends: 459 [2025-02-05 20:08:05,769 INFO L226 Difference]: Without dead ends: 369 [2025-02-05 20:08:05,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:08:05,769 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 77 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:05,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 301 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:08:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-05 20:08:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 295. [2025-02-05 20:08:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.2210884353741496) internal successors, (359), 294 states have internal predecessors, (359), 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 20:08:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 359 transitions. [2025-02-05 20:08:05,782 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 359 transitions. Word has length 76 [2025-02-05 20:08:05,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:05,782 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 359 transitions. [2025-02-05 20:08:05,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 20:08:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 359 transitions. [2025-02-05 20:08:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 20:08:05,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:05,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:05,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 20:08:05,783 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:05,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash 792430730, now seen corresponding path program 1 times [2025-02-05 20:08:05,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:05,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827396484] [2025-02-05 20:08:05,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:05,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:05,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 20:08:05,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 20:08:05,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:05,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:06,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:06,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827396484] [2025-02-05 20:08:06,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827396484] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:08:06,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691802339] [2025-02-05 20:08:06,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:06,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:06,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:06,404 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 20:08:06,406 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 20:08:06,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 20:08:06,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 20:08:06,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:06,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:06,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-05 20:08:06,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:08:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 37 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 20:08:07,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:08:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 35 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:07,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691802339] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:08:07,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:08:07,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2025-02-05 20:08:07,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740687733] [2025-02-05 20:08:07,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:08:07,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 20:08:07,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:07,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 20:08:07,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-02-05 20:08:07,503 INFO L87 Difference]: Start difference. First operand 295 states and 359 transitions. Second operand has 31 states, 31 states have (on average 6.064516129032258) internal successors, (188), 31 states have internal predecessors, (188), 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 20:08:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:09,499 INFO L93 Difference]: Finished difference Result 1108 states and 1342 transitions. [2025-02-05 20:08:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-02-05 20:08:09,500 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.064516129032258) internal successors, (188), 31 states have internal predecessors, (188), 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 78 [2025-02-05 20:08:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:09,503 INFO L225 Difference]: With dead ends: 1108 [2025-02-05 20:08:09,503 INFO L226 Difference]: Without dead ends: 962 [2025-02-05 20:08:09,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1787 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1019, Invalid=5953, Unknown=0, NotChecked=0, Total=6972 [2025-02-05 20:08:09,506 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 759 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:09,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 504 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:08:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-02-05 20:08:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 620. [2025-02-05 20:08:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.2310177705977383) internal successors, (762), 619 states have internal predecessors, (762), 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 20:08:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 762 transitions. [2025-02-05 20:08:09,525 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 762 transitions. Word has length 78 [2025-02-05 20:08:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:09,525 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 762 transitions. [2025-02-05 20:08:09,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.064516129032258) internal successors, (188), 31 states have internal predecessors, (188), 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 20:08:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 762 transitions. [2025-02-05 20:08:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 20:08:09,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:09,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:09,536 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 20:08:09,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:09,727 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:09,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash 544131303, now seen corresponding path program 1 times [2025-02-05 20:08:09,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:09,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831337385] [2025-02-05 20:08:09,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:09,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:09,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 20:08:09,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 20:08:09,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:09,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:10,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831337385] [2025-02-05 20:08:10,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831337385] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:08:10,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836573535] [2025-02-05 20:08:10,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:10,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:10,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:10,097 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 20:08:10,100 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 20:08:10,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 20:08:10,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 20:08:10,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:10,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:10,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-05 20:08:10,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:08:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:10,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:08:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836573535] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:08:11,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:08:11,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 26 [2025-02-05 20:08:11,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412077409] [2025-02-05 20:08:11,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:08:11,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 20:08:11,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:11,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 20:08:11,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2025-02-05 20:08:11,051 INFO L87 Difference]: Start difference. First operand 620 states and 762 transitions. Second operand has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 26 states have internal predecessors, (183), 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 20:08:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:11,648 INFO L93 Difference]: Finished difference Result 1537 states and 1892 transitions. [2025-02-05 20:08:11,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 20:08:11,648 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 26 states have internal predecessors, (183), 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 79 [2025-02-05 20:08:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:11,652 INFO L225 Difference]: With dead ends: 1537 [2025-02-05 20:08:11,652 INFO L226 Difference]: Without dead ends: 1201 [2025-02-05 20:08:11,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 20:08:11,654 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 240 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:11,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1035 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:08:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-02-05 20:08:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 974. [2025-02-05 20:08:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 1.224049331963001) internal successors, (1191), 973 states have internal predecessors, (1191), 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 20:08:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1191 transitions. [2025-02-05 20:08:11,692 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1191 transitions. Word has length 79 [2025-02-05 20:08:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:11,692 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1191 transitions. [2025-02-05 20:08:11,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 26 states have internal predecessors, (183), 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 20:08:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1191 transitions. [2025-02-05 20:08:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 20:08:11,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:11,694 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:11,703 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 20:08:11,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:11,899 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:11,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash 239501995, now seen corresponding path program 1 times [2025-02-05 20:08:11,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:11,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007102593] [2025-02-05 20:08:11,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:11,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:11,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 20:08:11,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 20:08:11,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:11,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:12,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:12,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007102593] [2025-02-05 20:08:12,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007102593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:08:12,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046125830] [2025-02-05 20:08:12,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:12,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:12,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:12,504 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 20:08:12,508 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 20:08:12,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 20:08:12,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 20:08:12,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:12,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:12,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-02-05 20:08:12,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:08:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 27 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:13,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:08:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:15,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046125830] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:08:15,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:08:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 20] total 44 [2025-02-05 20:08:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497284469] [2025-02-05 20:08:15,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:08:15,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-05 20:08:15,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:15,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-05 20:08:15,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 20:08:15,074 INFO L87 Difference]: Start difference. First operand 974 states and 1191 transitions. Second operand has 44 states, 44 states have (on average 5.181818181818182) internal successors, (228), 44 states have internal predecessors, (228), 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 20:08:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:20,164 INFO L93 Difference]: Finished difference Result 3117 states and 3794 transitions. [2025-02-05 20:08:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-02-05 20:08:20,164 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.181818181818182) internal successors, (228), 44 states have internal predecessors, (228), 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 80 [2025-02-05 20:08:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:20,171 INFO L225 Difference]: With dead ends: 3117 [2025-02-05 20:08:20,171 INFO L226 Difference]: Without dead ends: 2503 [2025-02-05 20:08:20,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10317 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3386, Invalid=26026, Unknown=0, NotChecked=0, Total=29412 [2025-02-05 20:08:20,184 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1347 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:20,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 476 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:08:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-02-05 20:08:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 875. [2025-02-05 20:08:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.2540045766590389) internal successors, (1096), 874 states have internal predecessors, (1096), 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 20:08:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1096 transitions. [2025-02-05 20:08:20,219 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1096 transitions. Word has length 80 [2025-02-05 20:08:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:20,219 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1096 transitions. [2025-02-05 20:08:20,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.181818181818182) internal successors, (228), 44 states have internal predecessors, (228), 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 20:08:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1096 transitions. [2025-02-05 20:08:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 20:08:20,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:20,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:20,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 20:08:20,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 20:08:20,422 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:20,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:20,423 INFO L85 PathProgramCache]: Analyzing trace with hash -400135167, now seen corresponding path program 1 times [2025-02-05 20:08:20,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:20,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632104898] [2025-02-05 20:08:20,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:20,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:20,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 20:08:20,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 20:08:20,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:20,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 20:08:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632104898] [2025-02-05 20:08:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632104898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:20,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:08:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707667502] [2025-02-05 20:08:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:20,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:08:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:20,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:08:20,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:08:20,964 INFO L87 Difference]: Start difference. First operand 875 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 20:08:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:21,124 INFO L93 Difference]: Finished difference Result 1858 states and 2299 transitions. [2025-02-05 20:08:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:08:21,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 83 [2025-02-05 20:08:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:21,127 INFO L225 Difference]: With dead ends: 1858 [2025-02-05 20:08:21,127 INFO L226 Difference]: Without dead ends: 1023 [2025-02-05 20:08:21,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:08:21,129 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 39 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:21,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 362 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:08:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-02-05 20:08:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 895. [2025-02-05 20:08:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 1.2527964205816555) internal successors, (1120), 894 states have internal predecessors, (1120), 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 20:08:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1120 transitions. [2025-02-05 20:08:21,149 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1120 transitions. Word has length 83 [2025-02-05 20:08:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:21,149 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1120 transitions. [2025-02-05 20:08:21,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 20:08:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1120 transitions. [2025-02-05 20:08:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 20:08:21,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:21,151 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:21,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 20:08:21,152 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:21,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2045423230, now seen corresponding path program 1 times [2025-02-05 20:08:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:21,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118220195] [2025-02-05 20:08:21,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:21,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 20:08:21,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 20:08:21,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:21,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 20:08:21,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:21,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118220195] [2025-02-05 20:08:21,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118220195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:21,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:21,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:08:21,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936044125] [2025-02-05 20:08:21,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:21,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:08:21,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:21,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:08:21,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:08:21,467 INFO L87 Difference]: Start difference. First operand 895 states and 1120 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 20:08:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:21,561 INFO L93 Difference]: Finished difference Result 1897 states and 2338 transitions. [2025-02-05 20:08:21,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:08:21,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 104 [2025-02-05 20:08:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:21,564 INFO L225 Difference]: With dead ends: 1897 [2025-02-05 20:08:21,565 INFO L226 Difference]: Without dead ends: 1062 [2025-02-05 20:08:21,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:08:21,566 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 36 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:21,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 392 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:08:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-02-05 20:08:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 889. [2025-02-05 20:08:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.2522522522522523) internal successors, (1112), 888 states have internal predecessors, (1112), 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 20:08:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1112 transitions. [2025-02-05 20:08:21,586 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1112 transitions. Word has length 104 [2025-02-05 20:08:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:21,587 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1112 transitions. [2025-02-05 20:08:21,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 20:08:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1112 transitions. [2025-02-05 20:08:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 20:08:21,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:21,589 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:21,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 20:08:21,591 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:21,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:21,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1603075262, now seen corresponding path program 1 times [2025-02-05 20:08:21,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:21,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082420336] [2025-02-05 20:08:21,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:21,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 20:08:21,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 20:08:21,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:21,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 81 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 20:08:22,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082420336] [2025-02-05 20:08:22,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082420336] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:08:22,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572866058] [2025-02-05 20:08:22,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:22,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:22,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:22,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:08:22,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 20:08:22,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 20:08:22,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 20:08:22,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:22,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:22,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-05 20:08:22,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:08:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 84 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:23,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:08:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 62 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:24,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572866058] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:08:24,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:08:24,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 18] total 45 [2025-02-05 20:08:24,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688502821] [2025-02-05 20:08:24,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:08:24,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-05 20:08:24,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:24,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-05 20:08:24,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 20:08:24,413 INFO L87 Difference]: Start difference. First operand 889 states and 1112 transitions. Second operand has 45 states, 45 states have (on average 5.822222222222222) internal successors, (262), 45 states have internal predecessors, (262), 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 20:08:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:28,512 INFO L93 Difference]: Finished difference Result 3726 states and 4515 transitions. [2025-02-05 20:08:28,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-02-05 20:08:28,512 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 5.822222222222222) internal successors, (262), 45 states have internal predecessors, (262), 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 105 [2025-02-05 20:08:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:28,520 INFO L225 Difference]: With dead ends: 3726 [2025-02-05 20:08:28,520 INFO L226 Difference]: Without dead ends: 2877 [2025-02-05 20:08:28,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9609 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3990, Invalid=25422, Unknown=0, NotChecked=0, Total=29412 [2025-02-05 20:08:28,524 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1641 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:28,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1641 Valid, 1361 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:08:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2025-02-05 20:08:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1197. [2025-02-05 20:08:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1196 states have (on average 1.2533444816053512) internal successors, (1499), 1196 states have internal predecessors, (1499), 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 20:08:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1499 transitions. [2025-02-05 20:08:28,555 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1499 transitions. Word has length 105 [2025-02-05 20:08:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:28,555 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 1499 transitions. [2025-02-05 20:08:28,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.822222222222222) internal successors, (262), 45 states have internal predecessors, (262), 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 20:08:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1499 transitions. [2025-02-05 20:08:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 20:08:28,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:28,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:28,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 20:08:28,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:28,763 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:28,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:28,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1874911331, now seen corresponding path program 1 times [2025-02-05 20:08:28,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:28,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353654798] [2025-02-05 20:08:28,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:28,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:28,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 20:08:28,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 20:08:28,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:28,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 20:08:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353654798] [2025-02-05 20:08:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353654798] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:08:29,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428175283] [2025-02-05 20:08:29,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:29,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:29,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:29,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:08:29,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 20:08:29,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 20:08:29,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 20:08:29,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:29,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:29,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-02-05 20:08:29,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:08:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 87 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 20:08:30,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:08:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 61 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:32,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428175283] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:08:32,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:08:32,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 23] total 44 [2025-02-05 20:08:32,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433004233] [2025-02-05 20:08:32,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:08:32,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-05 20:08:32,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:32,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-05 20:08:32,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1659, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 20:08:32,410 INFO L87 Difference]: Start difference. First operand 1197 states and 1499 transitions. Second operand has 44 states, 44 states have (on average 5.7727272727272725) internal successors, (254), 44 states have internal predecessors, (254), 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 20:08:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:33,390 INFO L93 Difference]: Finished difference Result 3386 states and 4158 transitions. [2025-02-05 20:08:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-05 20:08:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.7727272727272725) internal successors, (254), 44 states have internal predecessors, (254), 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 107 [2025-02-05 20:08:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:33,396 INFO L225 Difference]: With dead ends: 3386 [2025-02-05 20:08:33,397 INFO L226 Difference]: Without dead ends: 2229 [2025-02-05 20:08:33,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=3409, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 20:08:33,399 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 264 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:33,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 409 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:08:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2025-02-05 20:08:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 1429. [2025-02-05 20:08:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1428 states have (on average 1.245798319327731) internal successors, (1779), 1428 states have internal predecessors, (1779), 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 20:08:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1779 transitions. [2025-02-05 20:08:33,430 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1779 transitions. Word has length 107 [2025-02-05 20:08:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:33,430 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1779 transitions. [2025-02-05 20:08:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.7727272727272725) internal successors, (254), 44 states have internal predecessors, (254), 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 20:08:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1779 transitions. [2025-02-05 20:08:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 20:08:33,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:33,433 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:33,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 20:08:33,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 20:08:33,639 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:33,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:33,641 INFO L85 PathProgramCache]: Analyzing trace with hash 825238759, now seen corresponding path program 1 times [2025-02-05 20:08:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525835255] [2025-02-05 20:08:33,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:33,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 20:08:33,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 20:08:33,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:33,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 118 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525835255] [2025-02-05 20:08:34,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525835255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:08:34,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312136234] [2025-02-05 20:08:34,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:34,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:34,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:34,941 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:08:34,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 20:08:35,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 20:08:35,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 20:08:35,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:35,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:35,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-05 20:08:35,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:08:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 63 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:36,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:08:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 50 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:37,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312136234] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:08:37,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:08:37,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 19] total 52 [2025-02-05 20:08:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7189724] [2025-02-05 20:08:37,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:08:37,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-05 20:08:37,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:37,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-05 20:08:37,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2420, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 20:08:37,259 INFO L87 Difference]: Start difference. First operand 1429 states and 1779 transitions. Second operand has 52 states, 52 states have (on average 5.865384615384615) internal successors, (305), 52 states have internal predecessors, (305), 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 20:08:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:57,668 INFO L93 Difference]: Finished difference Result 8512 states and 10193 transitions. [2025-02-05 20:08:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 468 states. [2025-02-05 20:08:57,668 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.865384615384615) internal successors, (305), 52 states have internal predecessors, (305), 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 108 [2025-02-05 20:08:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:57,683 INFO L225 Difference]: With dead ends: 8512 [2025-02-05 20:08:57,683 INFO L226 Difference]: Without dead ends: 7228 [2025-02-05 20:08:57,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112411 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=15680, Invalid=246976, Unknown=0, NotChecked=0, Total=262656 [2025-02-05 20:08:57,708 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 2548 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 5208 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2548 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 5291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 5208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:57,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2548 Valid, 1641 Invalid, 5291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 5208 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 20:08:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7228 states. [2025-02-05 20:08:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7228 to 2937. [2025-02-05 20:08:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2937 states, 2936 states have (on average 1.2510217983651226) internal successors, (3673), 2936 states have internal predecessors, (3673), 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 20:08:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 3673 transitions. [2025-02-05 20:08:57,814 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 3673 transitions. Word has length 108 [2025-02-05 20:08:57,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:57,814 INFO L471 AbstractCegarLoop]: Abstraction has 2937 states and 3673 transitions. [2025-02-05 20:08:57,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.865384615384615) internal successors, (305), 52 states have internal predecessors, (305), 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 20:08:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 3673 transitions. [2025-02-05 20:08:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 20:08:57,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:57,821 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:57,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 20:08:58,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:58,022 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:58,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash 808308206, now seen corresponding path program 1 times [2025-02-05 20:08:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:58,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406809411] [2025-02-05 20:08:58,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:58,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 20:08:58,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 20:08:58,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:58,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 55 proven. 50 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 20:08:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406809411] [2025-02-05 20:08:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406809411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:08:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144721719] [2025-02-05 20:08:58,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:58,856 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:08:58,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 20:08:59,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 20:08:59,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 20:08:59,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:59,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:59,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-02-05 20:08:59,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:09:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 22 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:09:00,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:09:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 114 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 20:09:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144721719] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:09:03,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:09:03,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23, 22] total 54 [2025-02-05 20:09:03,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47942044] [2025-02-05 20:09:03,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:09:03,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-05 20:09:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:09:03,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-05 20:09:03,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2556, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 20:09:03,616 INFO L87 Difference]: Start difference. First operand 2937 states and 3673 transitions. Second operand has 54 states, 54 states have (on average 5.407407407407407) internal successors, (292), 54 states have internal predecessors, (292), 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 20:09:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:09:06,639 INFO L93 Difference]: Finished difference Result 6702 states and 8200 transitions. [2025-02-05 20:09:06,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-02-05 20:09:06,640 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.407407407407407) internal successors, (292), 54 states have internal predecessors, (292), 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 109 [2025-02-05 20:09:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:09:06,648 INFO L225 Difference]: With dead ends: 6702 [2025-02-05 20:09:06,648 INFO L226 Difference]: Without dead ends: 4267 [2025-02-05 20:09:06,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5536 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2276, Invalid=15546, Unknown=0, NotChecked=0, Total=17822 [2025-02-05 20:09:06,654 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1086 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:09:06,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 596 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:09:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2025-02-05 20:09:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 2066. [2025-02-05 20:09:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2065 states have (on average 1.2440677966101694) internal successors, (2569), 2065 states have internal predecessors, (2569), 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 20:09:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2569 transitions. [2025-02-05 20:09:06,741 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2569 transitions. Word has length 109 [2025-02-05 20:09:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:09:06,741 INFO L471 AbstractCegarLoop]: Abstraction has 2066 states and 2569 transitions. [2025-02-05 20:09:06,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.407407407407407) internal successors, (292), 54 states have internal predecessors, (292), 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 20:09:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2569 transitions. [2025-02-05 20:09:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 20:09:06,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:09:06,745 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:09:06,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0