./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ms3.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/array-fpi/ms3.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 b493eaf5cbb9a8ad0f724257518d8f922b0657033a5eb7aa4f50992fe6ac33a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:31:05,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:31:05,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:31:05,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:31:05,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:31:05,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:31:05,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:31:05,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:31:05,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:31:05,380 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:31:05,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:31:05,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:31:05,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:31:05,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:31:05,381 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:31:05,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:31:05,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:31:05,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:31:05,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:31:05,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:31:05,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:31:05,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:31:05,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:31:05,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:31:05,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:31:05,383 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:31:05,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:31:05,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:31:05,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:31:05,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:31:05,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:31:05,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:31:05,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:31:05,384 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 -> b493eaf5cbb9a8ad0f724257518d8f922b0657033a5eb7aa4f50992fe6ac33a4 [2025-02-05 10:31:05,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:31:05,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:31:05,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:31:05,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:31:05,574 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:31:05,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ms3.c [2025-02-05 10:31:06,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c19c9ac9c/0769960fe33e436a871527c266cbea09/FLAG3ea1ec598 [2025-02-05 10:31:06,947 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:31:06,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/ms3.c [2025-02-05 10:31:06,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c19c9ac9c/0769960fe33e436a871527c266cbea09/FLAG3ea1ec598 [2025-02-05 10:31:07,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c19c9ac9c/0769960fe33e436a871527c266cbea09 [2025-02-05 10:31:07,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:31:07,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:31:07,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:31:07,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:31:07,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:31:07,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc7d1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07, skipping insertion in model container [2025-02-05 10:31:07,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:31:07,391 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/array-fpi/ms3.c[586,599] [2025-02-05 10:31:07,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:31:07,413 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:31:07,422 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/array-fpi/ms3.c[586,599] [2025-02-05 10:31:07,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:31:07,436 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:31:07,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07 WrapperNode [2025-02-05 10:31:07,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:31:07,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:31:07,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:31:07,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:31:07,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,463 INFO L138 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2025-02-05 10:31:07,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:31:07,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:31:07,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:31:07,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:31:07,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,480 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 6, 4, 2]. 43 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0, 0]. The 3 writes are split as follows [0, 0, 2, 1]. [2025-02-05 10:31:07,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:31:07,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:31:07,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:31:07,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:31:07,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (1/1) ... [2025-02-05 10:31:07,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:31:07,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:31:07,523 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 10:31:07,528 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 10:31:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:31:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:31:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:31:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:31:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 10:31:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:31:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:31:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:31:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:31:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 10:31:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 10:31:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:31:07,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:31:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:31:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:31:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:31:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 10:31:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:31:07,602 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:31:07,604 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:31:07,704 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-02-05 10:31:07,708 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-05 10:31:07,708 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:31:07,713 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:31:07,714 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:31:07,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:31:07 BoogieIcfgContainer [2025-02-05 10:31:07,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:31:07,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:31:07,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:31:07,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:31:07,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:31:07" (1/3) ... [2025-02-05 10:31:07,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ade0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:31:07, skipping insertion in model container [2025-02-05 10:31:07,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:07" (2/3) ... [2025-02-05 10:31:07,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ade0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:31:07, skipping insertion in model container [2025-02-05 10:31:07,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:31:07" (3/3) ... [2025-02-05 10:31:07,720 INFO L128 eAbstractionObserver]: Analyzing ICFG ms3.c [2025-02-05 10:31:07,729 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:31:07,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ms3.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:31:07,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:31:07,780 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;@7321e32a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:31:07,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:31:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:31:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 10:31:07,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:31:07,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:31:07,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:31:07,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:31:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash -673256721, now seen corresponding path program 1 times [2025-02-05 10:31:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:31:07,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178414200] [2025-02-05 10:31:07,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:31:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:31:07,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 10:31:07,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 10:31:07,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:31:07,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:07,875 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 10:31:07,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:31:07,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178414200] [2025-02-05 10:31:07,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178414200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:31:07,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:31:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:31:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492886496] [2025-02-05 10:31:07,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:31:07,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:31:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:31:07,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:31:07,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:31:07,893 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 10:31:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:31:07,902 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-02-05 10:31:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:31:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-02-05 10:31:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:31:07,907 INFO L225 Difference]: With dead ends: 28 [2025-02-05 10:31:07,907 INFO L226 Difference]: Without dead ends: 12 [2025-02-05 10:31:07,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:31:07,911 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:31:07,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:31:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-05 10:31:07,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-05 10:31:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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 10:31:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-02-05 10:31:07,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2025-02-05 10:31:07,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:31:07,929 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-05 10:31:07,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 10:31:07,930 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-02-05 10:31:07,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 10:31:07,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:31:07,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:31:07,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:31:07,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:31:07,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:31:07,931 INFO L85 PathProgramCache]: Analyzing trace with hash -644627570, now seen corresponding path program 1 times [2025-02-05 10:31:07,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:31:07,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378569744] [2025-02-05 10:31:07,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:31:07,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:31:07,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 10:31:07,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 10:31:07,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:31:07,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:08,031 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 10:31:08,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:31:08,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378569744] [2025-02-05 10:31:08,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378569744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:31:08,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:31:08,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:31:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854910839] [2025-02-05 10:31:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:31:08,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:31:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:31:08,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:31:08,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:31:08,033 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 10:31:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:31:08,065 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-02-05 10:31:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:31:08,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-02-05 10:31:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:31:08,066 INFO L225 Difference]: With dead ends: 22 [2025-02-05 10:31:08,066 INFO L226 Difference]: Without dead ends: 16 [2025-02-05 10:31:08,066 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 10:31:08,067 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:31:08,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:31:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-05 10:31:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-02-05 10:31:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 10:31:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-02-05 10:31:08,070 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2025-02-05 10:31:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:31:08,070 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-05 10:31:08,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 10:31:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-02-05 10:31:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 10:31:08,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:31:08,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:31:08,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:31:08,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:31:08,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:31:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash 380854543, now seen corresponding path program 1 times [2025-02-05 10:31:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:31:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365532604] [2025-02-05 10:31:08,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:31:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:31:08,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 10:31:08,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 10:31:08,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:31:08,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:31:08,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:31:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365532604] [2025-02-05 10:31:08,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365532604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:31:08,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:31:08,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:31:08,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690829069] [2025-02-05 10:31:08,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:31:08,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:31:08,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:31:08,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:31:08,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:31:08,287 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 10:31:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:31:08,334 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2025-02-05 10:31:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:31:08,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-05 10:31:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:31:08,335 INFO L225 Difference]: With dead ends: 21 [2025-02-05 10:31:08,335 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 10:31:08,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:31:08,336 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:31:08,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:31:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 10:31:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-02-05 10:31:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 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 10:31:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-02-05 10:31:08,342 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2025-02-05 10:31:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:31:08,343 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-02-05 10:31:08,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 10:31:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-02-05 10:31:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 10:31:08,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:31:08,344 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:31:08,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:31:08,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:31:08,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:31:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1146644267, now seen corresponding path program 1 times [2025-02-05 10:31:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:31:08,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283236456] [2025-02-05 10:31:08,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:31:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:31:08,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 10:31:08,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:31:08,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:31:08,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:08,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:31:08,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283236456] [2025-02-05 10:31:08,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283236456] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:31:08,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150729970] [2025-02-05 10:31:08,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:31:08,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:31:08,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:31:08,465 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 10:31:08,467 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 10:31:08,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 10:31:08,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:31:08,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:31:08,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:08,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:31:08,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:31:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:08,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:31:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:08,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150729970] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:31:08,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:31:08,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 10:31:08,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610364828] [2025-02-05 10:31:08,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:31:08,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:31:08,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:31:08,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:31:08,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:31:08,633 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:31:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:31:08,693 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-02-05 10:31:08,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:31:08,693 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 10:31:08,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:31:08,693 INFO L225 Difference]: With dead ends: 32 [2025-02-05 10:31:08,694 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 10:31:08,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:31:08,694 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:31:08,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:31:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 10:31:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-05 10:31:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 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 10:31:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-02-05 10:31:08,697 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2025-02-05 10:31:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:31:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-02-05 10:31:08,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:31:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-02-05 10:31:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:31:08,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:31:08,698 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:31:08,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:31:08,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:31:08,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:31:08,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:31:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash 906134127, now seen corresponding path program 2 times [2025-02-05 10:31:08,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:31:08,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540164797] [2025-02-05 10:31:08,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:31:08,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:31:08,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-05 10:31:08,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:31:08,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:31:08,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:09,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:31:09,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540164797] [2025-02-05 10:31:09,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540164797] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:31:09,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694370868] [2025-02-05 10:31:09,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:31:09,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:31:09,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:31:09,381 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 10:31:09,382 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 10:31:09,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-05 10:31:09,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:31:09,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:31:09,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:09,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-05 10:31:09,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:31:09,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:31:09,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:31:09,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-05 10:31:09,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 10:31:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:09,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:31:09,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2025-02-05 10:31:09,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:31:09,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 77 [2025-02-05 10:31:09,864 INFO L349 Elim1Store]: treesize reduction 18, result has 55.0 percent of original size [2025-02-05 10:31:09,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 58 [2025-02-05 10:31:09,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:31:09,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2025-02-05 10:31:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:09,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694370868] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:31:09,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:31:09,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-05 10:31:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226835031] [2025-02-05 10:31:09,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:31:09,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 10:31:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:31:09,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 10:31:09,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2025-02-05 10:31:09,925 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 27 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 10:31:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:31:10,150 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-02-05 10:31:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:31:10,150 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 17 [2025-02-05 10:31:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:31:10,150 INFO L225 Difference]: With dead ends: 31 [2025-02-05 10:31:10,151 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 10:31:10,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 10:31:10,151 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:31:10,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 53 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:31:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 10:31:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-02-05 10:31:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:31:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-02-05 10:31:10,154 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2025-02-05 10:31:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:31:10,154 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-02-05 10:31:10,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 10:31:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-02-05 10:31:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:31:10,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:31:10,155 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:31:10,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:31:10,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:31:10,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:31:10,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:31:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash 891583349, now seen corresponding path program 3 times [2025-02-05 10:31:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:31:10,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632657481] [2025-02-05 10:31:10,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:31:10,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:31:10,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-02-05 10:31:10,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:31:10,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 10:31:10,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:10,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:31:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632657481] [2025-02-05 10:31:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632657481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:31:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354219943] [2025-02-05 10:31:10,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:31:10,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:31:10,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:31:10,443 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 10:31:10,446 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 10:31:10,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-02-05 10:31:10,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:31:10,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 10:31:10,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:10,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:31:10,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:31:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:10,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:31:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354219943] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:31:10,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:31:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-02-05 10:31:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232410764] [2025-02-05 10:31:10,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:31:10,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:31:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:31:10,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:31:10,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:31:10,568 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 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 10:31:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:31:10,619 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-02-05 10:31:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:31:10,619 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 10:31:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:31:10,619 INFO L225 Difference]: With dead ends: 42 [2025-02-05 10:31:10,619 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 10:31:10,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:31:10,620 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:31:10,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:31:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 10:31:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-02-05 10:31:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:31:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-02-05 10:31:10,622 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2025-02-05 10:31:10,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:31:10,622 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-02-05 10:31:10,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 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 10:31:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-02-05 10:31:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:31:10,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:31:10,623 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:31:10,628 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 10:31:10,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:31:10,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:31:10,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:31:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -832763889, now seen corresponding path program 4 times [2025-02-05 10:31:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:31:10,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049450348] [2025-02-05 10:31:10,826 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:31:10,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:31:10,841 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-02-05 10:31:10,854 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-02-05 10:31:10,854 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:31:10,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:31:11,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:31:11,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049450348] [2025-02-05 10:31:11,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049450348] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:31:11,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242991086] [2025-02-05 10:31:11,305 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:31:11,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:31:11,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:31:11,309 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 10:31:11,314 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 10:31:11,348 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-02-05 10:31:11,356 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-02-05 10:31:11,356 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:31:11,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:11,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 10:31:11,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:31:11,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2025-02-05 10:31:11,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:31:11,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2025-02-05 10:31:11,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 111 [2025-02-05 10:31:11,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 137 [2025-02-05 10:31:11,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 48 [2025-02-05 10:31:12,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:31:13,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-05 10:31:15,351 INFO L349 Elim1Store]: treesize reduction 35, result has 78.3 percent of original size [2025-02-05 10:31:15,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 217 treesize of output 210 [2025-02-05 10:31:15,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-05 10:31:16,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2025-02-05 10:31:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:31:16,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:31:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:31:16,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242991086] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:31:16,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:31:16,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-02-05 10:31:16,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579509666] [2025-02-05 10:31:16,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:31:16,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 10:31:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:31:16,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 10:31:16,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 10:31:16,680 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:31:22,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:31:26,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:31:45,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:31:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:31:50,342 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-02-05 10:31:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 10:31:50,343 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 10:31:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:31:50,345 INFO L225 Difference]: With dead ends: 41 [2025-02-05 10:31:50,345 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 10:31:50,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=431, Invalid=2220, Unknown=1, NotChecked=0, Total=2652 [2025-02-05 10:31:50,348 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 48 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:31:50,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 62 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 277 Invalid, 2 Unknown, 0 Unchecked, 13.1s Time] [2025-02-05 10:31:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 10:31:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-02-05 10:31:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:31:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-02-05 10:31:50,374 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2025-02-05 10:31:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:31:50,374 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-02-05 10:31:50,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:31:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-02-05 10:31:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:31:50,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:31:50,375 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:31:50,381 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 10:31:50,580 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,SelfDestructingSolverStorable6 [2025-02-05 10:31:50,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:31:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:31:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1018654251, now seen corresponding path program 5 times [2025-02-05 10:31:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:31:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948402589] [2025-02-05 10:31:50,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:31:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:31:50,593 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 5 equivalence classes. [2025-02-05 10:31:50,615 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:31:50,615 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-05 10:31:50,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:50,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:31:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948402589] [2025-02-05 10:31:50,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948402589] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:31:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366402554] [2025-02-05 10:31:50,709 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:31:50,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:31:50,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:31:50,711 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 10:31:50,712 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 10:31:50,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 5 equivalence classes. [2025-02-05 10:31:50,777 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:31:50,777 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-05 10:31:50,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:50,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 10:31:50,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:31:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:50,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:31:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:50,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366402554] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:31:50,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:31:50,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2025-02-05 10:31:50,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620063384] [2025-02-05 10:31:50,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:31:50,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:31:50,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:31:50,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:31:50,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:31:50,883 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:31:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:31:50,973 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-02-05 10:31:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 10:31:50,973 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 10:31:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:31:50,974 INFO L225 Difference]: With dead ends: 52 [2025-02-05 10:31:50,974 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 10:31:50,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:31:50,974 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:31:50,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 30 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:31:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 10:31:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-02-05 10:31:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 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 10:31:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-02-05 10:31:50,982 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2025-02-05 10:31:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:31:50,982 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-05 10:31:50,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:31:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-02-05 10:31:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:31:50,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:31:50,982 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:31:50,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:31:51,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:31:51,183 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:31:51,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:31:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1110097553, now seen corresponding path program 6 times [2025-02-05 10:31:51,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:31:51,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114773484] [2025-02-05 10:31:51,183 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:31:51,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:31:51,189 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 5 equivalence classes. [2025-02-05 10:31:51,210 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:31:51,210 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-05 10:31:51,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:52,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:31:52,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114773484] [2025-02-05 10:31:52,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114773484] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:31:52,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045781080] [2025-02-05 10:31:52,026 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:31:52,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:31:52,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:31:52,028 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 10:31:52,030 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 10:31:52,068 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 5 equivalence classes. [2025-02-05 10:31:52,091 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:31:52,091 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-05 10:31:52,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:31:52,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-05 10:31:52,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:31:52,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:31:52,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:31:52,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:31:52,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:31:52,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:31:52,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-02-05 10:31:53,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:31:54,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-05 10:31:56,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-05 10:31:58,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-02-05 10:31:58,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:31:58,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:31:58,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:31:58,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 58 [2025-02-05 10:31:58,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2025-02-05 10:31:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:31:58,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:31:59,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2025-02-05 10:31:59,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:31:59,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 77 [2025-02-05 10:31:59,962 INFO L349 Elim1Store]: treesize reduction 13, result has 91.9 percent of original size [2025-02-05 10:31:59,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 14475 treesize of output 12208 [2025-02-05 10:32:02,488 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:03,646 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:03,973 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:04,451 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:04,605 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:04,823 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:04,927 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:05,141 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:06,246 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:06,931 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:07,632 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:08,384 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:08,797 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:08,880 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:09,141 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:09,862 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:10,805 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:10,972 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:11,088 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:11,482 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:11,650 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:11,792 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-05 10:32:12,075 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:12,147 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:12,265 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:12,596 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:12,729 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:12,829 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:12,935 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:12,990 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:13,110 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:13,380 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:13,634 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:13,899 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:14,084 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:14,159 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:14,813 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:15,124 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:15,689 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:15,797 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:16,049 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:16,174 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:16,218 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:16,267 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:16,418 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:16,541 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:16,646 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:17,053 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:17,204 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:17,533 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-05 10:32:17,713 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:17,839 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:17,926 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:18,140 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:18,253 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:18,322 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:18,374 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:18,415 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:18,486 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:18,712 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:18,945 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:19,197 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:19,364 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:19,443 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:20,182 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:20,520 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:21,081 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:21,196 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:21,454 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:21,610 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:21,668 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:21,786 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-05 10:32:22,019 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:24,252 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-05 10:32:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:35,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045781080] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:32:35,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:32:35,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2025-02-05 10:32:35,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420916760] [2025-02-05 10:32:35,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:32:35,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-05 10:32:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:32:35,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-05 10:32:35,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1971, Unknown=7, NotChecked=0, Total=2352 [2025-02-05 10:32:35,365 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 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 10:32:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:32:45,830 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2025-02-05 10:32:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 10:32:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 10:32:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:32:45,833 INFO L225 Difference]: With dead ends: 50 [2025-02-05 10:32:45,833 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 10:32:45,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=787, Invalid=3487, Unknown=16, NotChecked=0, Total=4290 [2025-02-05 10:32:45,835 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:32:45,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 81 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:32:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 10:32:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2025-02-05 10:32:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 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 10:32:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-02-05 10:32:45,846 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2025-02-05 10:32:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:32:45,846 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-02-05 10:32:45,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 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 10:32:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-02-05 10:32:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 10:32:45,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:45,847 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:45,853 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 10:32:46,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-05 10:32:46,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:46,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash 451239029, now seen corresponding path program 7 times [2025-02-05 10:32:46,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:46,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881131290] [2025-02-05 10:32:46,051 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:32:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:46,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 10:32:46,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 10:32:46,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:46,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:46,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:32:46,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881131290] [2025-02-05 10:32:46,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881131290] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:32:46,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353534018] [2025-02-05 10:32:46,204 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:32:46,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:46,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:32:46,206 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 10:32:46,209 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 10:32:46,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 10:32:46,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 10:32:46,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:32:46,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:46,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:32:46,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:32:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:46,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:32:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:46,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353534018] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:32:46,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:32:46,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-02-05 10:32:46,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879847690] [2025-02-05 10:32:46,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:32:46,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 10:32:46,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:32:46,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 10:32:46,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:32:46,464 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:32:46,598 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2025-02-05 10:32:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 10:32:46,598 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-05 10:32:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:32:46,599 INFO L225 Difference]: With dead ends: 51 [2025-02-05 10:32:46,599 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 10:32:46,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:32:46,599 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:32:46,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:32:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 10:32:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-02-05 10:32:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 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 10:32:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-02-05 10:32:46,616 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2025-02-05 10:32:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:32:46,617 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-02-05 10:32:46,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:32:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-02-05 10:32:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:32:46,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:32:46,619 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:32:46,629 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 10:32:46,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:46,820 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:32:46,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:32:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1711493361, now seen corresponding path program 8 times [2025-02-05 10:32:46,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:32:46,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919545949] [2025-02-05 10:32:46,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:32:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:32:46,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-05 10:32:46,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:32:46,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:32:46,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:32:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:32:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919545949] [2025-02-05 10:32:48,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919545949] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:32:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361905038] [2025-02-05 10:32:48,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:32:48,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:32:48,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:32:48,107 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 10:32:48,110 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 10:32:48,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-05 10:32:48,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:32:48,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:32:48,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:32:48,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-05 10:32:48,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:32:48,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:32:48,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-05 10:32:48,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:32:48,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-05 10:32:48,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:32:48,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-05 10:32:48,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:32:48,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-05 10:32:48,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-05 10:32:48,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11