./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label48.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a889f150dc2c455e03355eaf9dfccf3bdcd55e31f50409b2096126a8e217346 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:33:46,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:33:46,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:33:46,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:33:46,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:33:46,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:33:46,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:33:46,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:33:46,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:33:46,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:33:46,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:33:46,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:33:46,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:33:46,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:33:46,806 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:33:46,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:33:46,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:33:46,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:33:46,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:33:46,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:33:46,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:33:46,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:33:46,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:33:46,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:33:46,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:33:46,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:33:46,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:33:46,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:33:46,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:33:46,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:33:46,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:33:46,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:33:46,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:33:46,809 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a889f150dc2c455e03355eaf9dfccf3bdcd55e31f50409b2096126a8e217346 [2025-02-05 11:33:47,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:33:47,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:33:47,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:33:47,079 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:33:47,079 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:33:47,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label48.c [2025-02-05 11:33:48,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49bb875e1/e7ac07936dfc43d5b720c3d2081525b3/FLAGff94336a5 [2025-02-05 11:33:48,626 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:33:48,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label48.c [2025-02-05 11:33:48,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49bb875e1/e7ac07936dfc43d5b720c3d2081525b3/FLAGff94336a5 [2025-02-05 11:33:48,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49bb875e1/e7ac07936dfc43d5b720c3d2081525b3 [2025-02-05 11:33:48,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:33:48,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:33:48,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:33:48,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:33:48,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:33:48,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:48" (1/1) ... [2025-02-05 11:33:48,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60474417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:48, skipping insertion in model container [2025-02-05 11:33:48,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:48" (1/1) ... [2025-02-05 11:33:48,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:33:49,075 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/eca-rers2012/Problem11_label48.c[7294,7307] [2025-02-05 11:33:49,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:33:49,229 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:33:49,254 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/eca-rers2012/Problem11_label48.c[7294,7307] [2025-02-05 11:33:49,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:33:49,338 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:33:49,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49 WrapperNode [2025-02-05 11:33:49,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:33:49,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:33:49,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:33:49,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:33:49,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,443 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-02-05 11:33:49,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:33:49,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:33:49,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:33:49,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:33:49,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,517 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 11:33:49,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:33:49,587 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:33:49,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:33:49,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:33:49,588 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (1/1) ... [2025-02-05 11:33:49,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:33:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:33:49,617 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 11:33:49,655 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 11:33:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:33:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:33:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:33:49,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:33:49,718 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:33:49,719 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:33:51,344 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-05 11:33:51,344 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:33:51,368 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:33:51,370 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:33:51,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:51 BoogieIcfgContainer [2025-02-05 11:33:51,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:33:51,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:33:51,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:33:51,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:33:51,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:33:48" (1/3) ... [2025-02-05 11:33:51,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2663c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:51, skipping insertion in model container [2025-02-05 11:33:51,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:49" (2/3) ... [2025-02-05 11:33:51,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2663c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:51, skipping insertion in model container [2025-02-05 11:33:51,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:51" (3/3) ... [2025-02-05 11:33:51,382 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label48.c [2025-02-05 11:33:51,395 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:33:51,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label48.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:33:51,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:33:51,463 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;@676bf938, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:33:51,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:33:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 11:33:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 11:33:51,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:51,475 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, 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 11:33:51,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:51,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2128463492, now seen corresponding path program 1 times [2025-02-05 11:33:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:51,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859226323] [2025-02-05 11:33:51,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:51,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:51,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 11:33:51,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 11:33:51,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:51,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:51,831 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 11:33:51,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859226323] [2025-02-05 11:33:51,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859226323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:51,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:51,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:33:51,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045741883] [2025-02-05 11:33:51,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:51,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:51,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:51,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:51,858 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 11:33:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:52,780 INFO L93 Difference]: Finished difference Result 776 states and 1360 transitions. [2025-02-05 11:33:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:52,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 11:33:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:52,793 INFO L225 Difference]: With dead ends: 776 [2025-02-05 11:33:52,793 INFO L226 Difference]: Without dead ends: 413 [2025-02-05 11:33:52,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:52,799 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 177 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:52,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:33:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-05 11:33:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-02-05 11:33:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 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 11:33:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2025-02-05 11:33:52,849 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 50 [2025-02-05 11:33:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:52,849 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2025-02-05 11:33:52,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 11:33:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2025-02-05 11:33:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 11:33:52,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:52,854 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-05 11:33:52,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:33:52,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:52,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1942688399, now seen corresponding path program 1 times [2025-02-05 11:33:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:52,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807734634] [2025-02-05 11:33:52,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:52,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 11:33:52,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 11:33:52,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:52,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:33:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807734634] [2025-02-05 11:33:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807734634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:33:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126439395] [2025-02-05 11:33:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:53,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:53,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:53,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:53,117 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 11:33:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:53,733 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2025-02-05 11:33:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:53,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 118 [2025-02-05 11:33:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:53,736 INFO L225 Difference]: With dead ends: 1209 [2025-02-05 11:33:53,737 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 11:33:53,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:53,738 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:53,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:33:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 11:33:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2025-02-05 11:33:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 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 11:33:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2025-02-05 11:33:53,767 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 118 [2025-02-05 11:33:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:53,768 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2025-02-05 11:33:53,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 11:33:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2025-02-05 11:33:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 11:33:53,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:53,770 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:53,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:33:53,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:53,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:53,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1788106604, now seen corresponding path program 1 times [2025-02-05 11:33:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:53,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121900230] [2025-02-05 11:33:53,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:53,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:53,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 11:33:53,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 11:33:53,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:53,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:33:54,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:54,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121900230] [2025-02-05 11:33:54,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121900230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:54,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:54,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:33:54,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152250887] [2025-02-05 11:33:54,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:54,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:54,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:54,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:54,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:54,012 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 11:33:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:54,540 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2025-02-05 11:33:54,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:54,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120 [2025-02-05 11:33:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:54,546 INFO L225 Difference]: With dead ends: 1941 [2025-02-05 11:33:54,546 INFO L226 Difference]: Without dead ends: 1156 [2025-02-05 11:33:54,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:54,549 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:54,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:33:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-02-05 11:33:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2025-02-05 11:33:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 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 11:33:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2025-02-05 11:33:54,594 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 120 [2025-02-05 11:33:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:54,594 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2025-02-05 11:33:54,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 11:33:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2025-02-05 11:33:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 11:33:54,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:54,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:54,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:33:54,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:54,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1195066169, now seen corresponding path program 1 times [2025-02-05 11:33:54,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:54,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255232084] [2025-02-05 11:33:54,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:54,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:54,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 11:33:54,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 11:33:54,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:54,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-05 11:33:54,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:54,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255232084] [2025-02-05 11:33:54,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255232084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:54,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:54,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:33:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586878230] [2025-02-05 11:33:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:54,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:54,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:54,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:54,822 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 11:33:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:55,496 INFO L93 Difference]: Finished difference Result 3056 states and 3914 transitions. [2025-02-05 11:33:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:55,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 162 [2025-02-05 11:33:55,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:55,504 INFO L225 Difference]: With dead ends: 3056 [2025-02-05 11:33:55,504 INFO L226 Difference]: Without dead ends: 1902 [2025-02-05 11:33:55,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:55,508 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:55,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:33:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-02-05 11:33:55,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1901. [2025-02-05 11:33:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1900 states have (on average 1.22) internal successors, (2318), 1900 states have internal predecessors, (2318), 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 11:33:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2318 transitions. [2025-02-05 11:33:55,543 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2318 transitions. Word has length 162 [2025-02-05 11:33:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:55,544 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2318 transitions. [2025-02-05 11:33:55,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 11:33:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2318 transitions. [2025-02-05 11:33:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 11:33:55,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:55,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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 11:33:55,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:33:55,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:55,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:55,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1239073823, now seen corresponding path program 1 times [2025-02-05 11:33:55,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:55,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434129442] [2025-02-05 11:33:55,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:55,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:55,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 11:33:55,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 11:33:55,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:55,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:33:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:55,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434129442] [2025-02-05 11:33:55,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434129442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:55,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:55,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379439955] [2025-02-05 11:33:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:55,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:55,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:55,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:55,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:55,740 INFO L87 Difference]: Start difference. First operand 1901 states and 2318 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 11:33:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:56,403 INFO L93 Difference]: Finished difference Result 4550 states and 5629 transitions. [2025-02-05 11:33:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:56,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 177 [2025-02-05 11:33:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:56,417 INFO L225 Difference]: With dead ends: 4550 [2025-02-05 11:33:56,417 INFO L226 Difference]: Without dead ends: 2835 [2025-02-05 11:33:56,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:56,424 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 155 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:56,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 336 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:33:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2025-02-05 11:33:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2456. [2025-02-05 11:33:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 2455 states have (on average 1.2118126272912424) internal successors, (2975), 2455 states have internal predecessors, (2975), 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 11:33:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 2975 transitions. [2025-02-05 11:33:56,477 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 2975 transitions. Word has length 177 [2025-02-05 11:33:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:56,477 INFO L471 AbstractCegarLoop]: Abstraction has 2456 states and 2975 transitions. [2025-02-05 11:33:56,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 11:33:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 2975 transitions. [2025-02-05 11:33:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 11:33:56,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:56,481 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 11:33:56,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:33:56,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:56,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1920857961, now seen corresponding path program 1 times [2025-02-05 11:33:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712165492] [2025-02-05 11:33:56,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:56,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 11:33:56,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 11:33:56,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:56,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 11:33:56,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:56,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712165492] [2025-02-05 11:33:56,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712165492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:56,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:56,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:56,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120636182] [2025-02-05 11:33:56,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:56,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:56,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:56,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:56,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:56,704 INFO L87 Difference]: Start difference. First operand 2456 states and 2975 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 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 11:33:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:57,424 INFO L93 Difference]: Finished difference Result 5655 states and 6930 transitions. [2025-02-05 11:33:57,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:57,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 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) Word has length 232 [2025-02-05 11:33:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:57,437 INFO L225 Difference]: With dead ends: 5655 [2025-02-05 11:33:57,437 INFO L226 Difference]: Without dead ends: 3201 [2025-02-05 11:33:57,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:57,441 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 147 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:57,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 387 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:33:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2025-02-05 11:33:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3008. [2025-02-05 11:33:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.2048553375457267) internal successors, (3623), 3007 states have internal predecessors, (3623), 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 11:33:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3623 transitions. [2025-02-05 11:33:57,487 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3623 transitions. Word has length 232 [2025-02-05 11:33:57,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:57,488 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 3623 transitions. [2025-02-05 11:33:57,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 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 11:33:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3623 transitions. [2025-02-05 11:33:57,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 11:33:57,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:57,491 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:33:57,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:33:57,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:57,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:57,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1627916868, now seen corresponding path program 1 times [2025-02-05 11:33:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:57,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339731648] [2025-02-05 11:33:57,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:57,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:57,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 11:33:57,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 11:33:57,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:57,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:33:57,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:57,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339731648] [2025-02-05 11:33:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339731648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:57,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:57,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213946946] [2025-02-05 11:33:57,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:57,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:57,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:57,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:57,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:57,716 INFO L87 Difference]: Start difference. First operand 3008 states and 3623 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 11:33:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:58,387 INFO L93 Difference]: Finished difference Result 7503 states and 9172 transitions. [2025-02-05 11:33:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:58,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 259 [2025-02-05 11:33:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:58,399 INFO L225 Difference]: With dead ends: 7503 [2025-02-05 11:33:58,399 INFO L226 Difference]: Without dead ends: 4497 [2025-02-05 11:33:58,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:58,404 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 118 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:58,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 181 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:33:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2025-02-05 11:33:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 4493. [2025-02-05 11:33:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4493 states, 4492 states have (on average 1.205253784505788) internal successors, (5414), 4492 states have internal predecessors, (5414), 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 11:33:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 5414 transitions. [2025-02-05 11:33:58,468 INFO L78 Accepts]: Start accepts. Automaton has 4493 states and 5414 transitions. Word has length 259 [2025-02-05 11:33:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:58,468 INFO L471 AbstractCegarLoop]: Abstraction has 4493 states and 5414 transitions. [2025-02-05 11:33:58,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 11:33:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 5414 transitions. [2025-02-05 11:33:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-05 11:33:58,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:58,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:58,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:33:58,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:58,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2100132953, now seen corresponding path program 1 times [2025-02-05 11:33:58,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:58,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458441385] [2025-02-05 11:33:58,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:58,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:58,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-05 11:33:58,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-05 11:33:58,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:58,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 145 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:33:59,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458441385] [2025-02-05 11:33:59,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458441385] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:33:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421557922] [2025-02-05 11:33:59,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:59,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:59,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:33:59,185 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 11:33:59,187 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 11:33:59,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-05 11:33:59,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-05 11:33:59,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:59,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:59,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:33:59,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:33:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:33:59,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:33:59,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421557922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:59,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:33:59,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:33:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536475812] [2025-02-05 11:33:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:59,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:33:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:59,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:33:59,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:33:59,586 INFO L87 Difference]: Start difference. First operand 4493 states and 5414 transitions. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 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 11:34:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:01,036 INFO L93 Difference]: Finished difference Result 12128 states and 14817 transitions. [2025-02-05 11:34:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:01,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 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 269 [2025-02-05 11:34:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:01,059 INFO L225 Difference]: With dead ends: 12128 [2025-02-05 11:34:01,060 INFO L226 Difference]: Without dead ends: 7637 [2025-02-05 11:34:01,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:34:01,066 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 223 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:01,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 72 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:34:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7637 states. [2025-02-05 11:34:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7637 to 7629. [2025-02-05 11:34:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7629 states, 7628 states have (on average 1.2135553224960671) internal successors, (9257), 7628 states have internal predecessors, (9257), 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 11:34:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7629 states to 7629 states and 9257 transitions. [2025-02-05 11:34:01,198 INFO L78 Accepts]: Start accepts. Automaton has 7629 states and 9257 transitions. Word has length 269 [2025-02-05 11:34:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:01,199 INFO L471 AbstractCegarLoop]: Abstraction has 7629 states and 9257 transitions. [2025-02-05 11:34:01,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 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 11:34:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7629 states and 9257 transitions. [2025-02-05 11:34:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-05 11:34:01,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:01,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:01,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:34:01,409 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 11:34:01,409 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:01,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1205452483, now seen corresponding path program 1 times [2025-02-05 11:34:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:01,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81343028] [2025-02-05 11:34:01,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:01,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-05 11:34:01,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-05 11:34:01,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:01,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:01,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81343028] [2025-02-05 11:34:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81343028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:01,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:01,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:34:01,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596516945] [2025-02-05 11:34:01,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:01,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:34:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:01,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:34:01,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:34:01,997 INFO L87 Difference]: Start difference. First operand 7629 states and 9257 transitions. Second operand has 5 states, 5 states have (on average 53.8) internal successors, (269), 4 states have internal predecessors, (269), 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 11:34:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:03,622 INFO L93 Difference]: Finished difference Result 17294 states and 21285 transitions. [2025-02-05 11:34:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:34:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 4 states have internal predecessors, (269), 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 269 [2025-02-05 11:34:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:03,657 INFO L225 Difference]: With dead ends: 17294 [2025-02-05 11:34:03,657 INFO L226 Difference]: Without dead ends: 10035 [2025-02-05 11:34:03,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:34:03,669 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 400 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:03,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 104 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:34:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10035 states. [2025-02-05 11:34:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10035 to 9101. [2025-02-05 11:34:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9101 states, 9100 states have (on average 1.202087912087912) internal successors, (10939), 9100 states have internal predecessors, (10939), 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 11:34:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9101 states to 9101 states and 10939 transitions. [2025-02-05 11:34:03,878 INFO L78 Accepts]: Start accepts. Automaton has 9101 states and 10939 transitions. Word has length 269 [2025-02-05 11:34:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:03,879 INFO L471 AbstractCegarLoop]: Abstraction has 9101 states and 10939 transitions. [2025-02-05 11:34:03,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 4 states have internal predecessors, (269), 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 11:34:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 9101 states and 10939 transitions. [2025-02-05 11:34:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-02-05 11:34:03,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:03,891 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:03,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:34:03,891 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:03,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1609739761, now seen corresponding path program 1 times [2025-02-05 11:34:03,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:03,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957057150] [2025-02-05 11:34:03,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:03,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-05 11:34:03,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-05 11:34:03,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:03,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 11:34:04,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:04,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957057150] [2025-02-05 11:34:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957057150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:04,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:04,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520758872] [2025-02-05 11:34:04,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:04,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:04,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:04,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:04,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:04,043 INFO L87 Difference]: Start difference. First operand 9101 states and 10939 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 11:34:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:04,801 INFO L93 Difference]: Finished difference Result 21142 states and 25702 transitions. [2025-02-05 11:34:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:04,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 280 [2025-02-05 11:34:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:04,832 INFO L225 Difference]: With dead ends: 21142 [2025-02-05 11:34:04,832 INFO L226 Difference]: Without dead ends: 12411 [2025-02-05 11:34:04,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:04,840 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 172 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:04,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 348 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12411 states. [2025-02-05 11:34:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12411 to 12227. [2025-02-05 11:34:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12227 states, 12226 states have (on average 1.1932766235890724) internal successors, (14589), 12226 states have internal predecessors, (14589), 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 11:34:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12227 states to 12227 states and 14589 transitions. [2025-02-05 11:34:05,003 INFO L78 Accepts]: Start accepts. Automaton has 12227 states and 14589 transitions. Word has length 280 [2025-02-05 11:34:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:05,004 INFO L471 AbstractCegarLoop]: Abstraction has 12227 states and 14589 transitions. [2025-02-05 11:34:05,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 11:34:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 12227 states and 14589 transitions. [2025-02-05 11:34:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-02-05 11:34:05,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:05,011 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-02-05 11:34:05,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:34:05,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:05,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:05,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1792609038, now seen corresponding path program 1 times [2025-02-05 11:34:05,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:05,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324882717] [2025-02-05 11:34:05,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:05,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:05,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-05 11:34:05,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-05 11:34:05,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:05,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 95 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324882717] [2025-02-05 11:34:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324882717] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342098816] [2025-02-05 11:34:05,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:05,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:05,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:05,251 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 11:34:05,253 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 11:34:05,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-05 11:34:05,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-05 11:34:05,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:05,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:05,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:34:05,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:05,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:34:05,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342098816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:05,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:34:05,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:34:05,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890872351] [2025-02-05 11:34:05,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:05,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:05,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:05,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:05,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:34:05,805 INFO L87 Difference]: Start difference. First operand 12227 states and 14589 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 11:34:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:06,577 INFO L93 Difference]: Finished difference Result 25578 states and 30608 transitions. [2025-02-05 11:34:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:06,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 283 [2025-02-05 11:34:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:06,599 INFO L225 Difference]: With dead ends: 25578 [2025-02-05 11:34:06,600 INFO L226 Difference]: Without dead ends: 13721 [2025-02-05 11:34:06,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:34:06,614 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 99 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:06,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 354 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13721 states. [2025-02-05 11:34:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13721 to 13710. [2025-02-05 11:34:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13710 states, 13709 states have (on average 1.1884893135896126) internal successors, (16293), 13709 states have internal predecessors, (16293), 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 11:34:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13710 states to 13710 states and 16293 transitions. [2025-02-05 11:34:06,790 INFO L78 Accepts]: Start accepts. Automaton has 13710 states and 16293 transitions. Word has length 283 [2025-02-05 11:34:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:06,790 INFO L471 AbstractCegarLoop]: Abstraction has 13710 states and 16293 transitions. [2025-02-05 11:34:06,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 11:34:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 13710 states and 16293 transitions. [2025-02-05 11:34:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-05 11:34:06,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:06,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:06,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 11:34:07,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:07,000 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:07,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 55023826, now seen corresponding path program 1 times [2025-02-05 11:34:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006677500] [2025-02-05 11:34:07,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:07,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-05 11:34:07,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-05 11:34:07,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:07,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:07,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:07,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006677500] [2025-02-05 11:34:07,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006677500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:07,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:07,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:34:07,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124238905] [2025-02-05 11:34:07,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:07,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:07,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:07,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:07,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:07,300 INFO L87 Difference]: Start difference. First operand 13710 states and 16293 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 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 11:34:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:08,475 INFO L93 Difference]: Finished difference Result 30191 states and 36130 transitions. [2025-02-05 11:34:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:08,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 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 286 [2025-02-05 11:34:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:08,501 INFO L225 Difference]: With dead ends: 30191 [2025-02-05 11:34:08,502 INFO L226 Difference]: Without dead ends: 16851 [2025-02-05 11:34:08,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:08,508 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 283 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:08,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 104 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:34:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16851 states. [2025-02-05 11:34:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16851 to 16842. [2025-02-05 11:34:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16842 states, 16841 states have (on average 1.1812837717475209) internal successors, (19894), 16841 states have internal predecessors, (19894), 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 11:34:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16842 states to 16842 states and 19894 transitions. [2025-02-05 11:34:08,650 INFO L78 Accepts]: Start accepts. Automaton has 16842 states and 19894 transitions. Word has length 286 [2025-02-05 11:34:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:08,650 INFO L471 AbstractCegarLoop]: Abstraction has 16842 states and 19894 transitions. [2025-02-05 11:34:08,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 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 11:34:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 16842 states and 19894 transitions. [2025-02-05 11:34:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 11:34:08,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:08,657 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 11:34:08,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:34:08,658 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:08,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash 75184426, now seen corresponding path program 1 times [2025-02-05 11:34:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:08,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801658185] [2025-02-05 11:34:08,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:08,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:08,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 11:34:08,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 11:34:08,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:08,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 11:34:08,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:08,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801658185] [2025-02-05 11:34:08,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801658185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:08,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:08,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089533241] [2025-02-05 11:34:08,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:08,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:08,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:08,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:08,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:08,751 INFO L87 Difference]: Start difference. First operand 16842 states and 19894 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 11:34:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:09,335 INFO L93 Difference]: Finished difference Result 32572 states and 38573 transitions. [2025-02-05 11:34:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:09,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 308 [2025-02-05 11:34:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:09,426 INFO L225 Difference]: With dead ends: 32572 [2025-02-05 11:34:09,426 INFO L226 Difference]: Without dead ends: 16100 [2025-02-05 11:34:09,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:09,439 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 174 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:09,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 151 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16100 states. [2025-02-05 11:34:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16100 to 15914. [2025-02-05 11:34:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15914 states, 15913 states have (on average 1.1271916043486458) internal successors, (17937), 15913 states have internal predecessors, (17937), 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 11:34:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15914 states to 15914 states and 17937 transitions. [2025-02-05 11:34:09,621 INFO L78 Accepts]: Start accepts. Automaton has 15914 states and 17937 transitions. Word has length 308 [2025-02-05 11:34:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:09,622 INFO L471 AbstractCegarLoop]: Abstraction has 15914 states and 17937 transitions. [2025-02-05 11:34:09,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 11:34:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 15914 states and 17937 transitions. [2025-02-05 11:34:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-05 11:34:09,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:09,630 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:09,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:34:09,631 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:09,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1235336946, now seen corresponding path program 1 times [2025-02-05 11:34:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:09,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83239813] [2025-02-05 11:34:09,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:09,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-05 11:34:09,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-05 11:34:09,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:09,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:34:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83239813] [2025-02-05 11:34:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83239813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:09,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:09,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469244483] [2025-02-05 11:34:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:09,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:09,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:09,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:09,773 INFO L87 Difference]: Start difference. First operand 15914 states and 17937 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 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 11:34:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:10,355 INFO L93 Difference]: Finished difference Result 34769 states and 39303 transitions. [2025-02-05 11:34:10,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:10,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 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) Word has length 312 [2025-02-05 11:34:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:10,380 INFO L225 Difference]: With dead ends: 34769 [2025-02-05 11:34:10,380 INFO L226 Difference]: Without dead ends: 19041 [2025-02-05 11:34:10,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:10,395 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 152 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:10,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 358 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19041 states. [2025-02-05 11:34:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19041 to 17192. [2025-02-05 11:34:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17192 states, 17191 states have (on average 1.120644523297074) internal successors, (19265), 17191 states have internal predecessors, (19265), 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 11:34:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17192 states to 17192 states and 19265 transitions. [2025-02-05 11:34:10,646 INFO L78 Accepts]: Start accepts. Automaton has 17192 states and 19265 transitions. Word has length 312 [2025-02-05 11:34:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:10,647 INFO L471 AbstractCegarLoop]: Abstraction has 17192 states and 19265 transitions. [2025-02-05 11:34:10,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 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 11:34:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 17192 states and 19265 transitions. [2025-02-05 11:34:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-02-05 11:34:10,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:10,653 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:10,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:34:10,654 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:10,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1223854561, now seen corresponding path program 1 times [2025-02-05 11:34:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:10,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17870944] [2025-02-05 11:34:10,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:10,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-05 11:34:10,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-05 11:34:10,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:10,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 221 proven. 72 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 11:34:11,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17870944] [2025-02-05 11:34:11,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17870944] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453251869] [2025-02-05 11:34:11,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:11,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:11,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:11,249 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 11:34:11,251 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 11:34:11,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-05 11:34:11,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-05 11:34:11,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:11,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:11,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:34:11,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 11:34:11,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:34:11,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453251869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:11,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:34:11,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:34:11,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961767968] [2025-02-05 11:34:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:11,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:11,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:11,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:11,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:34:11,598 INFO L87 Difference]: Start difference. First operand 17192 states and 19265 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 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 11:34:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:12,164 INFO L93 Difference]: Finished difference Result 36596 states and 40991 transitions. [2025-02-05 11:34:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:12,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 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) Word has length 337 [2025-02-05 11:34:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:12,186 INFO L225 Difference]: With dead ends: 36596 [2025-02-05 11:34:12,187 INFO L226 Difference]: Without dead ends: 19406 [2025-02-05 11:34:12,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:34:12,202 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 84 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:12,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 364 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19406 states. [2025-02-05 11:34:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19406 to 18668. [2025-02-05 11:34:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18668 states, 18667 states have (on average 1.115390796592918) internal successors, (20821), 18667 states have internal predecessors, (20821), 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 11:34:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18668 states to 18668 states and 20821 transitions. [2025-02-05 11:34:12,398 INFO L78 Accepts]: Start accepts. Automaton has 18668 states and 20821 transitions. Word has length 337 [2025-02-05 11:34:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:12,398 INFO L471 AbstractCegarLoop]: Abstraction has 18668 states and 20821 transitions. [2025-02-05 11:34:12,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 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 11:34:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 18668 states and 20821 transitions. [2025-02-05 11:34:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-05 11:34:12,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:12,409 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-02-05 11:34:12,418 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 11:34:12,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:12,610 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:12,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 634806666, now seen corresponding path program 1 times [2025-02-05 11:34:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:12,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805630017] [2025-02-05 11:34:12,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:12,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-05 11:34:12,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-05 11:34:12,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:12,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 254 proven. 54 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-02-05 11:34:13,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:13,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805630017] [2025-02-05 11:34:13,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805630017] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:13,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631421867] [2025-02-05 11:34:13,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:13,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:13,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:13,596 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 11:34:13,598 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 11:34:13,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-05 11:34:13,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-05 11:34:13,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:13,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:13,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:34:13,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-02-05 11:34:14,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:34:14,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631421867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:14,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:34:14,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:34:14,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883305902] [2025-02-05 11:34:14,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:14,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:14,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:14,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:34:14,043 INFO L87 Difference]: Start difference. First operand 18668 states and 20821 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 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 11:34:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:14,757 INFO L93 Difference]: Finished difference Result 37887 states and 42217 transitions. [2025-02-05 11:34:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:14,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 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) Word has length 358 [2025-02-05 11:34:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:14,785 INFO L225 Difference]: With dead ends: 37887 [2025-02-05 11:34:14,786 INFO L226 Difference]: Without dead ends: 19221 [2025-02-05 11:34:14,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:34:14,803 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 91 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:14,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 169 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:34:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19221 states. [2025-02-05 11:34:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19221 to 17564. [2025-02-05 11:34:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17564 states, 17563 states have (on average 1.1126800660479417) internal successors, (19542), 17563 states have internal predecessors, (19542), 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 11:34:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17564 states to 17564 states and 19542 transitions. [2025-02-05 11:34:15,059 INFO L78 Accepts]: Start accepts. Automaton has 17564 states and 19542 transitions. Word has length 358 [2025-02-05 11:34:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:15,060 INFO L471 AbstractCegarLoop]: Abstraction has 17564 states and 19542 transitions. [2025-02-05 11:34:15,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 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 11:34:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 17564 states and 19542 transitions. [2025-02-05 11:34:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-05 11:34:15,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:15,068 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:34:15,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 11:34:15,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 11:34:15,269 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:15,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash 73952254, now seen corresponding path program 1 times [2025-02-05 11:34:15,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:15,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229303313] [2025-02-05 11:34:15,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:15,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:15,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 11:34:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 11:34:15,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:15,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 11:34:15,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:15,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229303313] [2025-02-05 11:34:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229303313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:15,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:15,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:15,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271094767] [2025-02-05 11:34:15,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:15,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:15,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:15,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:15,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:15,451 INFO L87 Difference]: Start difference. First operand 17564 states and 19542 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 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 11:34:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:16,372 INFO L93 Difference]: Finished difference Result 43992 states and 48866 transitions. [2025-02-05 11:34:16,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:16,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 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 375 [2025-02-05 11:34:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:16,403 INFO L225 Difference]: With dead ends: 43992 [2025-02-05 11:34:16,403 INFO L226 Difference]: Without dead ends: 26430 [2025-02-05 11:34:16,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:16,423 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 203 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:16,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 81 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:34:16,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26430 states. [2025-02-05 11:34:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26430 to 23650. [2025-02-05 11:34:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23650 states, 23649 states have (on average 1.1092646623535878) internal successors, (26233), 23649 states have internal predecessors, (26233), 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 11:34:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23650 states to 23650 states and 26233 transitions. [2025-02-05 11:34:16,664 INFO L78 Accepts]: Start accepts. Automaton has 23650 states and 26233 transitions. Word has length 375 [2025-02-05 11:34:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:16,665 INFO L471 AbstractCegarLoop]: Abstraction has 23650 states and 26233 transitions. [2025-02-05 11:34:16,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 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 11:34:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 23650 states and 26233 transitions. [2025-02-05 11:34:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-05 11:34:16,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:16,677 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:34:16,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:34:16,678 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:16,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1788527472, now seen corresponding path program 1 times [2025-02-05 11:34:16,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:16,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108905512] [2025-02-05 11:34:16,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:16,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:16,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 11:34:16,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 11:34:16,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:16,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 267 proven. 78 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 11:34:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108905512] [2025-02-05 11:34:17,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108905512] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889544742] [2025-02-05 11:34:17,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:17,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:17,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:17,407 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 11:34:17,408 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 11:34:17,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 11:34:17,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 11:34:17,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:17,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:17,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 11:34:17,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 202 proven. 143 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 11:34:17,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:34:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 297 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 11:34:18,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889544742] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:34:18,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:34:18,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-02-05 11:34:18,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229535349] [2025-02-05 11:34:18,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:34:18,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 11:34:18,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:18,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 11:34:18,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-05 11:34:18,340 INFO L87 Difference]: Start difference. First operand 23650 states and 26233 transitions. Second operand has 11 states, 11 states have (on average 76.18181818181819) internal successors, (838), 11 states have internal predecessors, (838), 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 11:34:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:22,868 INFO L93 Difference]: Finished difference Result 59855 states and 66345 transitions. [2025-02-05 11:34:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 11:34:22,869 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 76.18181818181819) internal successors, (838), 11 states have internal predecessors, (838), 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 375 [2025-02-05 11:34:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:22,909 INFO L225 Difference]: With dead ends: 59855 [2025-02-05 11:34:22,910 INFO L226 Difference]: Without dead ends: 35655 [2025-02-05 11:34:22,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 758 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-02-05 11:34:22,925 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 2661 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 7198 mSolverCounterSat, 817 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2661 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 8015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 817 IncrementalHoareTripleChecker+Valid, 7198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:22,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2661 Valid, 226 Invalid, 8015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [817 Valid, 7198 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 11:34:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35655 states. [2025-02-05 11:34:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35655 to 18662. [2025-02-05 11:34:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18662 states, 18661 states have (on average 1.09865494882375) internal successors, (20502), 18661 states have internal predecessors, (20502), 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 11:34:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18662 states to 18662 states and 20502 transitions. [2025-02-05 11:34:23,238 INFO L78 Accepts]: Start accepts. Automaton has 18662 states and 20502 transitions. Word has length 375 [2025-02-05 11:34:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:23,239 INFO L471 AbstractCegarLoop]: Abstraction has 18662 states and 20502 transitions. [2025-02-05 11:34:23,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.18181818181819) internal successors, (838), 11 states have internal predecessors, (838), 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 11:34:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 18662 states and 20502 transitions. [2025-02-05 11:34:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-05 11:34:23,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:23,248 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-02-05 11:34:23,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 11:34:23,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 11:34:23,448 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:23,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:23,449 INFO L85 PathProgramCache]: Analyzing trace with hash -654954599, now seen corresponding path program 1 times [2025-02-05 11:34:23,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:23,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770162097] [2025-02-05 11:34:23,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:23,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:23,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 11:34:23,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 11:34:23,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:23,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 143 proven. 202 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-05 11:34:23,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:23,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770162097] [2025-02-05 11:34:23,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770162097] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:23,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080147180] [2025-02-05 11:34:23,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:23,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:23,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:23,737 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 11:34:23,738 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 11:34:23,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 11:34:23,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 11:34:23,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:23,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:23,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:34:23,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 11:34:24,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:34:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080147180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:24,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:34:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:34:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106911850] [2025-02-05 11:34:24,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:24,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:24,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:24,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:34:24,064 INFO L87 Difference]: Start difference. First operand 18662 states and 20502 transitions. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 3 states have internal predecessors, (334), 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 11:34:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:24,863 INFO L93 Difference]: Finished difference Result 38620 states and 42441 transitions. [2025-02-05 11:34:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 3 states have internal predecessors, (334), 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 381 [2025-02-05 11:34:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:24,887 INFO L225 Difference]: With dead ends: 38620 [2025-02-05 11:34:24,887 INFO L226 Difference]: Without dead ends: 20328 [2025-02-05 11:34:24,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:34:24,900 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 206 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:24,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 117 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20328 states. [2025-02-05 11:34:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20328 to 19400. [2025-02-05 11:34:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19400 states, 19399 states have (on average 1.0963967214804886) internal successors, (21269), 19399 states have internal predecessors, (21269), 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 11:34:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19400 states to 19400 states and 21269 transitions. [2025-02-05 11:34:25,133 INFO L78 Accepts]: Start accepts. Automaton has 19400 states and 21269 transitions. Word has length 381 [2025-02-05 11:34:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:25,134 INFO L471 AbstractCegarLoop]: Abstraction has 19400 states and 21269 transitions. [2025-02-05 11:34:25,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 3 states have internal predecessors, (334), 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 11:34:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 19400 states and 21269 transitions. [2025-02-05 11:34:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-02-05 11:34:25,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:25,142 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-02-05 11:34:25,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 11:34:25,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:25,343 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:25,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash 748977586, now seen corresponding path program 1 times [2025-02-05 11:34:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710531505] [2025-02-05 11:34:25,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:25,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-02-05 11:34:25,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-02-05 11:34:25,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:25,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 143 proven. 229 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 11:34:25,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:25,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710531505] [2025-02-05 11:34:25,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710531505] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:25,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305673173] [2025-02-05 11:34:25,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:25,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:25,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:25,622 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 11:34:25,626 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 11:34:25,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-02-05 11:34:25,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-02-05 11:34:25,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:25,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:25,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 11:34:25,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 248 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:27,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:34:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 248 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305673173] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:34:28,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:34:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2025-02-05 11:34:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319915266] [2025-02-05 11:34:28,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:34:28,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 11:34:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:28,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 11:34:28,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-05 11:34:28,872 INFO L87 Difference]: Start difference. First operand 19400 states and 21269 transitions. Second operand has 12 states, 12 states have (on average 80.83333333333333) internal successors, (970), 11 states have internal predecessors, (970), 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 11:34:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:33,861 INFO L93 Difference]: Finished difference Result 53772 states and 58684 transitions. [2025-02-05 11:34:33,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-05 11:34:33,862 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 80.83333333333333) internal successors, (970), 11 states have internal predecessors, (970), 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 417 [2025-02-05 11:34:33,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:33,899 INFO L225 Difference]: With dead ends: 53772 [2025-02-05 11:34:33,899 INFO L226 Difference]: Without dead ends: 34558 [2025-02-05 11:34:33,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 826 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=395, Invalid=1011, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 11:34:33,916 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 4315 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6185 mSolverCounterSat, 1272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4315 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1272 IncrementalHoareTripleChecker+Valid, 6185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:33,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4315 Valid, 161 Invalid, 7457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1272 Valid, 6185 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-05 11:34:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34558 states. [2025-02-05 11:34:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34558 to 22893. [2025-02-05 11:34:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22893 states, 22892 states have (on average 1.074742268041237) internal successors, (24603), 22892 states have internal predecessors, (24603), 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 11:34:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22893 states to 22893 states and 24603 transitions. [2025-02-05 11:34:34,163 INFO L78 Accepts]: Start accepts. Automaton has 22893 states and 24603 transitions. Word has length 417 [2025-02-05 11:34:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:34,163 INFO L471 AbstractCegarLoop]: Abstraction has 22893 states and 24603 transitions. [2025-02-05 11:34:34,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 80.83333333333333) internal successors, (970), 11 states have internal predecessors, (970), 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 11:34:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 22893 states and 24603 transitions. [2025-02-05 11:34:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-02-05 11:34:34,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:34,175 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:34,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 11:34:34,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:34,381 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:34,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:34,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2049477987, now seen corresponding path program 1 times [2025-02-05 11:34:34,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:34,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086856327] [2025-02-05 11:34:34,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:34,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:34,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-02-05 11:34:34,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-02-05 11:34:34,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:34,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-02-05 11:34:34,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:34,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086856327] [2025-02-05 11:34:34,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086856327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:34,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:34,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:34,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974958838] [2025-02-05 11:34:34,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:34,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:34,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:34,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:34,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:34,794 INFO L87 Difference]: Start difference. First operand 22893 states and 24603 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 11:34:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:35,350 INFO L93 Difference]: Finished difference Result 43951 states and 47292 transitions. [2025-02-05 11:34:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:35,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 511 [2025-02-05 11:34:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:35,387 INFO L225 Difference]: With dead ends: 43951 [2025-02-05 11:34:35,387 INFO L226 Difference]: Without dead ends: 22902 [2025-02-05 11:34:35,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:35,402 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:35,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 158 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:34:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22902 states. [2025-02-05 11:34:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22902 to 22157. [2025-02-05 11:34:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22157 states, 22156 states have (on average 1.0724408738039357) internal successors, (23761), 22156 states have internal predecessors, (23761), 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 11:34:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22157 states to 22157 states and 23761 transitions. [2025-02-05 11:34:35,595 INFO L78 Accepts]: Start accepts. Automaton has 22157 states and 23761 transitions. Word has length 511 [2025-02-05 11:34:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:35,595 INFO L471 AbstractCegarLoop]: Abstraction has 22157 states and 23761 transitions. [2025-02-05 11:34:35,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 11:34:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 22157 states and 23761 transitions. [2025-02-05 11:34:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-02-05 11:34:35,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:35,604 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:35,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 11:34:35,604 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:35,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1490636366, now seen corresponding path program 1 times [2025-02-05 11:34:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:35,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839489937] [2025-02-05 11:34:35,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:35,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-02-05 11:34:35,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-02-05 11:34:35,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:35,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 514 proven. 3 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-02-05 11:34:36,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839489937] [2025-02-05 11:34:36,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839489937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455173486] [2025-02-05 11:34:36,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:36,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:36,074 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 11:34:36,077 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 11:34:36,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-02-05 11:34:36,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-02-05 11:34:36,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:36,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:36,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:34:36,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-02-05 11:34:36,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:34:36,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455173486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:36,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:34:36,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-05 11:34:36,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827316359] [2025-02-05 11:34:36,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:36,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:36,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:36,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:36,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:34:36,466 INFO L87 Difference]: Start difference. First operand 22157 states and 23761 transitions. Second operand has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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 11:34:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:37,331 INFO L93 Difference]: Finished difference Result 45041 states and 48307 transitions. [2025-02-05 11:34:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:37,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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 512 [2025-02-05 11:34:37,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:37,359 INFO L225 Difference]: With dead ends: 45041 [2025-02-05 11:34:37,359 INFO L226 Difference]: Without dead ends: 23070 [2025-02-05 11:34:37,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:34:37,377 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 258 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:37,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 156 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:37,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23070 states. [2025-02-05 11:34:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23070 to 21041. [2025-02-05 11:34:37,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21041 states, 21040 states have (on average 1.0683460076045628) internal successors, (22478), 21040 states have internal predecessors, (22478), 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 11:34:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21041 states to 21041 states and 22478 transitions. [2025-02-05 11:34:37,598 INFO L78 Accepts]: Start accepts. Automaton has 21041 states and 22478 transitions. Word has length 512 [2025-02-05 11:34:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:37,598 INFO L471 AbstractCegarLoop]: Abstraction has 21041 states and 22478 transitions. [2025-02-05 11:34:37,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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 11:34:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21041 states and 22478 transitions. [2025-02-05 11:34:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-02-05 11:34:37,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:37,609 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:34:37,617 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 11:34:37,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:37,810 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:37,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash -394992789, now seen corresponding path program 1 times [2025-02-05 11:34:37,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:37,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328215471] [2025-02-05 11:34:37,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:37,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:37,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-02-05 11:34:37,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-02-05 11:34:37,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:37,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 609 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:39,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:39,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328215471] [2025-02-05 11:34:39,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328215471] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:39,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785229461] [2025-02-05 11:34:39,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:39,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:39,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:39,464 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 11:34:39,465 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 11:34:39,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-02-05 11:34:39,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-02-05 11:34:39,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:39,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:39,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:34:39,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-02-05 11:34:39,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:34:39,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785229461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:39,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:34:39,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-02-05 11:34:39,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288496562] [2025-02-05 11:34:39,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:39,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:39,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:39,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:39,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:34:39,774 INFO L87 Difference]: Start difference. First operand 21041 states and 22478 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 11:34:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:40,324 INFO L93 Difference]: Finished difference Result 42641 states and 45528 transitions. [2025-02-05 11:34:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:40,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 539 [2025-02-05 11:34:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:40,350 INFO L225 Difference]: With dead ends: 42641 [2025-02-05 11:34:40,350 INFO L226 Difference]: Without dead ends: 23260 [2025-02-05 11:34:40,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:34:40,364 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 91 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:40,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 339 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:34:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23260 states. [2025-02-05 11:34:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23260 to 20673. [2025-02-05 11:34:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20673 states, 20672 states have (on average 1.0685952012383901) internal successors, (22090), 20672 states have internal predecessors, (22090), 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 11:34:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20673 states to 20673 states and 22090 transitions. [2025-02-05 11:34:40,594 INFO L78 Accepts]: Start accepts. Automaton has 20673 states and 22090 transitions. Word has length 539 [2025-02-05 11:34:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:40,594 INFO L471 AbstractCegarLoop]: Abstraction has 20673 states and 22090 transitions. [2025-02-05 11:34:40,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 11:34:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 20673 states and 22090 transitions. [2025-02-05 11:34:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-02-05 11:34:40,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:40,605 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-05 11:34:40,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 11:34:40,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:40,806 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:40,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:40,807 INFO L85 PathProgramCache]: Analyzing trace with hash -188839228, now seen corresponding path program 1 times [2025-02-05 11:34:40,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:40,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798813515] [2025-02-05 11:34:40,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:40,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:40,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-02-05 11:34:40,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-02-05 11:34:40,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:40,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 191 proven. 406 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 11:34:41,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798813515] [2025-02-05 11:34:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798813515] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890318535] [2025-02-05 11:34:41,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:41,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:41,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:41,204 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 11:34:41,206 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 11:34:41,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-02-05 11:34:41,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-02-05 11:34:41,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:41,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:41,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 11:34:41,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 241 proven. 454 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-05 11:34:41,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:34:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 191 proven. 406 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 11:34:43,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890318535] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:34:43,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:34:43,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-02-05 11:34:43,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077471034] [2025-02-05 11:34:43,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:34:43,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 11:34:43,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:43,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 11:34:43,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:34:43,342 INFO L87 Difference]: Start difference. First operand 20673 states and 22090 transitions. Second operand has 10 states, 10 states have (on average 80.6) internal successors, (806), 9 states have internal predecessors, (806), 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 11:34:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:45,254 INFO L93 Difference]: Finished difference Result 38560 states and 41006 transitions. [2025-02-05 11:34:45,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 11:34:45,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 9 states have internal predecessors, (806), 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 572 [2025-02-05 11:34:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:45,294 INFO L225 Difference]: With dead ends: 38560 [2025-02-05 11:34:45,294 INFO L226 Difference]: Without dead ends: 38558 [2025-02-05 11:34:45,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1146 GetRequests, 1138 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:34:45,306 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 873 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2670 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:45,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 109 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 2670 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 11:34:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38558 states. [2025-02-05 11:34:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38558 to 13667. [2025-02-05 11:34:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13667 states, 13666 states have (on average 1.0708327235474902) internal successors, (14634), 13666 states have internal predecessors, (14634), 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 11:34:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13667 states to 13667 states and 14634 transitions. [2025-02-05 11:34:45,524 INFO L78 Accepts]: Start accepts. Automaton has 13667 states and 14634 transitions. Word has length 572 [2025-02-05 11:34:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:45,524 INFO L471 AbstractCegarLoop]: Abstraction has 13667 states and 14634 transitions. [2025-02-05 11:34:45,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 9 states have internal predecessors, (806), 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 11:34:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 13667 states and 14634 transitions. [2025-02-05 11:34:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-02-05 11:34:45,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:45,533 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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 11:34:45,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 11:34:45,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-05 11:34:45,734 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:45,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2134344882, now seen corresponding path program 1 times [2025-02-05 11:34:45,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:45,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290834091] [2025-02-05 11:34:45,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:45,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:45,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-02-05 11:34:45,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-02-05 11:34:45,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:45,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-02-05 11:34:46,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:46,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290834091] [2025-02-05 11:34:46,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290834091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:46,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:46,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808209112] [2025-02-05 11:34:46,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:46,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:46,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:46,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:46,121 INFO L87 Difference]: Start difference. First operand 13667 states and 14634 transitions. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 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 11:34:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:46,922 INFO L93 Difference]: Finished difference Result 29919 states and 31982 transitions. [2025-02-05 11:34:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:46,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 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 586 [2025-02-05 11:34:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:46,938 INFO L225 Difference]: With dead ends: 29919 [2025-02-05 11:34:46,938 INFO L226 Difference]: Without dead ends: 15884 [2025-02-05 11:34:46,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:46,947 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 185 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:46,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 70 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:34:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15884 states. [2025-02-05 11:34:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15884 to 13665. [2025-02-05 11:34:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13665 states, 13664 states have (on average 1.070038056206089) internal successors, (14621), 13664 states have internal predecessors, (14621), 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 11:34:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13665 states to 13665 states and 14621 transitions. [2025-02-05 11:34:47,074 INFO L78 Accepts]: Start accepts. Automaton has 13665 states and 14621 transitions. Word has length 586 [2025-02-05 11:34:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:47,074 INFO L471 AbstractCegarLoop]: Abstraction has 13665 states and 14621 transitions. [2025-02-05 11:34:47,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 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 11:34:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 13665 states and 14621 transitions. [2025-02-05 11:34:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-02-05 11:34:47,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:47,084 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-05 11:34:47,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 11:34:47,084 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:47,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:47,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1394789081, now seen corresponding path program 1 times [2025-02-05 11:34:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:47,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182520437] [2025-02-05 11:34:47,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:47,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:47,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-02-05 11:34:47,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-02-05 11:34:47,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:47,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 890 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-02-05 11:34:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182520437] [2025-02-05 11:34:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182520437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:47,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:47,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:47,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145845682] [2025-02-05 11:34:47,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:47,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:47,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:47,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:47,448 INFO L87 Difference]: Start difference. First operand 13665 states and 14621 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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 11:34:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:47,942 INFO L93 Difference]: Finished difference Result 28252 states and 30124 transitions. [2025-02-05 11:34:47,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:47,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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 704 [2025-02-05 11:34:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:47,956 INFO L225 Difference]: With dead ends: 28252 [2025-02-05 11:34:47,956 INFO L226 Difference]: Without dead ends: 14589 [2025-02-05 11:34:47,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:47,964 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 123 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:47,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 63 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:34:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14589 states. [2025-02-05 11:34:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14589 to 12561. [2025-02-05 11:34:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 12560 states have (on average 1.064888535031847) internal successors, (13375), 12560 states have internal predecessors, (13375), 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 11:34:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 13375 transitions. [2025-02-05 11:34:48,069 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 13375 transitions. Word has length 704 [2025-02-05 11:34:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:48,070 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 13375 transitions. [2025-02-05 11:34:48,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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 11:34:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 13375 transitions. [2025-02-05 11:34:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2025-02-05 11:34:48,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:48,079 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1] [2025-02-05 11:34:48,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 11:34:48,079 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:48,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:48,080 INFO L85 PathProgramCache]: Analyzing trace with hash 204535882, now seen corresponding path program 1 times [2025-02-05 11:34:48,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:48,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074953581] [2025-02-05 11:34:48,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:48,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:48,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-02-05 11:34:48,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-02-05 11:34:48,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:48,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 1314 proven. 73 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2025-02-05 11:34:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:48,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074953581] [2025-02-05 11:34:48,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074953581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:48,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289706345] [2025-02-05 11:34:48,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:48,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:48,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:48,900 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:34:48,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 11:34:48,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-02-05 11:34:49,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-02-05 11:34:49,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:49,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:49,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 11:34:49,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 975 proven. 496 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-02-05 11:34:50,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:34:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 975 proven. 496 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-02-05 11:34:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289706345] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:34:52,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:34:52,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 13 [2025-02-05 11:34:52,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401438989] [2025-02-05 11:34:52,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:34:52,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 11:34:52,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:52,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 11:34:52,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-05 11:34:52,434 INFO L87 Difference]: Start difference. First operand 12561 states and 13375 transitions. Second operand has 13 states, 13 states have (on average 98.53846153846153) internal successors, (1281), 13 states have internal predecessors, (1281), 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 11:34:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:57,340 INFO L93 Difference]: Finished difference Result 32351 states and 34390 transitions. [2025-02-05 11:34:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-05 11:34:57,341 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 98.53846153846153) internal successors, (1281), 13 states have internal predecessors, (1281), 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 835 [2025-02-05 11:34:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:57,364 INFO L225 Difference]: With dead ends: 32351 [2025-02-05 11:34:57,364 INFO L226 Difference]: Without dead ends: 19792 [2025-02-05 11:34:57,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1724 GetRequests, 1685 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=449, Invalid=1191, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 11:34:57,375 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 3694 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8026 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3694 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 8926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 8026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:57,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3694 Valid, 193 Invalid, 8926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 8026 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-05 11:34:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19792 states. [2025-02-05 11:34:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19792 to 9419. [2025-02-05 11:34:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9419 states, 9418 states have (on average 1.0630707156508812) internal successors, (10012), 9418 states have internal predecessors, (10012), 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 11:34:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 10012 transitions. [2025-02-05 11:34:57,515 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 10012 transitions. Word has length 835 [2025-02-05 11:34:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:57,515 INFO L471 AbstractCegarLoop]: Abstraction has 9419 states and 10012 transitions. [2025-02-05 11:34:57,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 98.53846153846153) internal successors, (1281), 13 states have internal predecessors, (1281), 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 11:34:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 10012 transitions. [2025-02-05 11:34:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2025-02-05 11:34:57,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:57,525 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-02-05 11:34:57,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 11:34:57,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 11:34:57,726 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:57,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:57,727 INFO L85 PathProgramCache]: Analyzing trace with hash -585616642, now seen corresponding path program 1 times [2025-02-05 11:34:57,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:57,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174726860] [2025-02-05 11:34:57,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:57,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:57,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 892 statements into 1 equivalence classes. [2025-02-05 11:34:57,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 892 of 892 statements. [2025-02-05 11:34:57,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:57,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 1638 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2025-02-05 11:34:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174726860] [2025-02-05 11:34:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174726860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:58,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:58,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:58,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10443486] [2025-02-05 11:34:58,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:58,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:58,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:58,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:58,300 INFO L87 Difference]: Start difference. First operand 9419 states and 10012 transitions. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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 11:34:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:58,830 INFO L93 Difference]: Finished difference Result 19579 states and 20824 transitions. [2025-02-05 11:34:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:58,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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 892 [2025-02-05 11:34:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:58,840 INFO L225 Difference]: With dead ends: 19579 [2025-02-05 11:34:58,840 INFO L226 Difference]: Without dead ends: 10714 [2025-02-05 11:34:58,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:58,846 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 127 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:58,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 124 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10714 states. [2025-02-05 11:34:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10714 to 9419. [2025-02-05 11:34:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9419 states, 9418 states have (on average 1.0625398173709917) internal successors, (10007), 9418 states have internal predecessors, (10007), 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 11:34:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 10007 transitions. [2025-02-05 11:34:58,930 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 10007 transitions. Word has length 892 [2025-02-05 11:34:58,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:58,930 INFO L471 AbstractCegarLoop]: Abstraction has 9419 states and 10007 transitions. [2025-02-05 11:34:58,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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 11:34:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 10007 transitions. [2025-02-05 11:34:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2025-02-05 11:34:58,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:58,938 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 11:34:58,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 11:34:58,939 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:58,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:58,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1842761477, now seen corresponding path program 1 times [2025-02-05 11:34:58,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:58,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517033244] [2025-02-05 11:34:58,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:58,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:58,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 915 statements into 1 equivalence classes. [2025-02-05 11:34:59,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 915 of 915 statements. [2025-02-05 11:34:59,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:59,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3097 backedges. 2039 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-05 11:34:59,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517033244] [2025-02-05 11:34:59,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517033244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:59,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:59,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:59,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143557118] [2025-02-05 11:34:59,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:59,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:59,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:59,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:59,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:59,253 INFO L87 Difference]: Start difference. First operand 9419 states and 10007 transitions. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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 11:34:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:59,785 INFO L93 Difference]: Finished difference Result 18655 states and 19818 transitions. [2025-02-05 11:34:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:34:59,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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 915 [2025-02-05 11:34:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:59,799 INFO L225 Difference]: With dead ends: 18655 [2025-02-05 11:34:59,800 INFO L226 Difference]: Without dead ends: 9606 [2025-02-05 11:34:59,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:34:59,809 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 112 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:59,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 335 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:34:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2025-02-05 11:34:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 8499. [2025-02-05 11:34:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8499 states, 8498 states have (on average 1.0620145916686279) internal successors, (9025), 8498 states have internal predecessors, (9025), 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 11:34:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8499 states to 8499 states and 9025 transitions. [2025-02-05 11:34:59,894 INFO L78 Accepts]: Start accepts. Automaton has 8499 states and 9025 transitions. Word has length 915 [2025-02-05 11:34:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:59,894 INFO L471 AbstractCegarLoop]: Abstraction has 8499 states and 9025 transitions. [2025-02-05 11:34:59,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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 11:34:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 8499 states and 9025 transitions. [2025-02-05 11:34:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2025-02-05 11:34:59,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:59,903 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:59,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 11:34:59,903 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:59,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash -258226864, now seen corresponding path program 1 times [2025-02-05 11:34:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:59,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933495782] [2025-02-05 11:34:59,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:59,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1067 statements into 1 equivalence classes. [2025-02-05 11:35:00,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1067 of 1067 statements. [2025-02-05 11:35:00,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:00,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 2832 proven. 0 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2025-02-05 11:35:00,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:00,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933495782] [2025-02-05 11:35:00,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933495782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:00,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:00,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:35:00,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844855351] [2025-02-05 11:35:00,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:00,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:35:00,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:00,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:35:00,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:35:00,706 INFO L87 Difference]: Start difference. First operand 8499 states and 9025 transitions. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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 11:35:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:01,538 INFO L93 Difference]: Finished difference Result 19394 states and 20616 transitions. [2025-02-05 11:35:01,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:35:01,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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 1067 [2025-02-05 11:35:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:01,549 INFO L225 Difference]: With dead ends: 19394 [2025-02-05 11:35:01,549 INFO L226 Difference]: Without dead ends: 11449 [2025-02-05 11:35:01,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:35:01,556 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 182 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:01,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 102 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:35:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11449 states. [2025-02-05 11:35:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11449 to 10343. [2025-02-05 11:35:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10343 states, 10342 states have (on average 1.062173660800619) internal successors, (10985), 10342 states have internal predecessors, (10985), 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 11:35:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10343 states to 10343 states and 10985 transitions. [2025-02-05 11:35:01,653 INFO L78 Accepts]: Start accepts. Automaton has 10343 states and 10985 transitions. Word has length 1067 [2025-02-05 11:35:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:01,654 INFO L471 AbstractCegarLoop]: Abstraction has 10343 states and 10985 transitions. [2025-02-05 11:35:01,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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 11:35:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 10343 states and 10985 transitions. [2025-02-05 11:35:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2025-02-05 11:35:01,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:01,664 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:35:01,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 11:35:01,664 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:01,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash -656901364, now seen corresponding path program 1 times [2025-02-05 11:35:01,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:01,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067505540] [2025-02-05 11:35:01,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:01,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1074 statements into 1 equivalence classes. [2025-02-05 11:35:01,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1074 of 1074 statements. [2025-02-05 11:35:01,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:01,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3397 backedges. 2489 proven. 0 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2025-02-05 11:35:02,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:02,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067505540] [2025-02-05 11:35:02,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067505540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:02,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:02,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:35:02,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120861382] [2025-02-05 11:35:02,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:02,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:35:02,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:02,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:35:02,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:35:02,526 INFO L87 Difference]: Start difference. First operand 10343 states and 10985 transitions. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 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 11:35:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:03,222 INFO L93 Difference]: Finished difference Result 16989 states and 18009 transitions. [2025-02-05 11:35:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:35:03,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 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 1074 [2025-02-05 11:35:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:03,224 INFO L225 Difference]: With dead ends: 16989 [2025-02-05 11:35:03,224 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:35:03,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:35:03,230 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 202 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:03,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 33 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:35:03,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:35:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:35:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 11:35:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:35:03,231 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1074 [2025-02-05 11:35:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:03,232 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:35:03,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 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 11:35:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:35:03,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:35:03,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:35:03,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 11:35:03,237 INFO L422 BasicCegarLoop]: Path program 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, 1, 1, 1, 1] [2025-02-05 11:35:03,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.