./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s2lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/s2lif.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 b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:43:31,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:43:31,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:43:31,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:43:31,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:43:31,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:43:31,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:43:31,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:43:31,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:43:31,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:43:31,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:43:31,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:43:31,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:43:31,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:43:31,608 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:43:31,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:43:31,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:43:31,608 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:43:31,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:43:31,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:43:31,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:43:31,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:43:31,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:43:31,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:43:31,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:43:31,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:43:31,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:43:31,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:43:31,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:43:31,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:43:31,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:43:31,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:43:31,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:43:31,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:43:31,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:43:31,611 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 -> b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f [2025-01-08 22:43:31,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:43:31,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:43:31,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:43:31,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:43:31,886 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:43:31,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s2lif.c [2025-01-08 22:43:33,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f1490034/5849249e761a499ca4db264e0a056977/FLAGa3505fefd [2025-01-08 22:43:33,390 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:43:33,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/s2lif.c [2025-01-08 22:43:33,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f1490034/5849249e761a499ca4db264e0a056977/FLAGa3505fefd [2025-01-08 22:43:33,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f1490034/5849249e761a499ca4db264e0a056977 [2025-01-08 22:43:33,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:43:33,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:43:33,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:43:33,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:43:33,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:43:33,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5204af21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33, skipping insertion in model container [2025-01-08 22:43:33,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:43:33,618 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/s2lif.c[588,601] [2025-01-08 22:43:33,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:43:33,651 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:43:33,664 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/s2lif.c[588,601] [2025-01-08 22:43:33,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:43:33,687 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:43:33,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33 WrapperNode [2025-01-08 22:43:33,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:43:33,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:43:33,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:43:33,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:43:33,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,730 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2025-01-08 22:43:33,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:43:33,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:43:33,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:43:33,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:43:33,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,751 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 8, 7, 4]. 38 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 5 writes are split as follows [0, 0, 3, 2]. [2025-01-08 22:43:33,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,757 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:43:33,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:43:33,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:43:33,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:43:33,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (1/1) ... [2025-01-08 22:43:33,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:43:33,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:33,790 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-01-08 22:43:33,793 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-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-08 22:43:33,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-08 22:43:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:43:33,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:43:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:43:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:43:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:43:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-08 22:43:33,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:43:33,892 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:43:33,894 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:43:34,007 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-08 22:43:34,008 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:43:34,015 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:43:34,016 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:43:34,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:43:34 BoogieIcfgContainer [2025-01-08 22:43:34,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:43:34,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:43:34,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:43:34,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:43:34,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:43:33" (1/3) ... [2025-01-08 22:43:34,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401d60af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:43:34, skipping insertion in model container [2025-01-08 22:43:34,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:43:33" (2/3) ... [2025-01-08 22:43:34,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401d60af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:43:34, skipping insertion in model container [2025-01-08 22:43:34,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:43:34" (3/3) ... [2025-01-08 22:43:34,024 INFO L128 eAbstractionObserver]: Analyzing ICFG s2lif.c [2025-01-08 22:43:34,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:43:34,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s2lif.c that has 1 procedures, 17 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-08 22:43:34,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:43:34,104 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;@78f4b5ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:43:34,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:43:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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-01-08 22:43:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:43:34,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:34,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:34,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:34,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:34,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1096719852, now seen corresponding path program 1 times [2025-01-08 22:43:34,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:34,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017370897] [2025-01-08 22:43:34,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:43:34,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:34,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:43:34,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:43:34,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:43:34,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:34,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:34,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017370897] [2025-01-08 22:43:34,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017370897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:43:34,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:43:34,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:43:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928421915] [2025-01-08 22:43:34,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:43:34,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:43:34,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:34,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:43:34,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:43:34,278 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-01-08 22:43:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:34,288 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-01-08 22:43:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:43:34,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-01-08 22:43:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:34,301 INFO L225 Difference]: With dead ends: 30 [2025-01-08 22:43:34,301 INFO L226 Difference]: Without dead ends: 13 [2025-01-08 22:43:34,308 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-01-08 22:43:34,310 INFO L435 NwaCegarLoop]: 21 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, 21 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-01-08 22:43:34,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:43:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-08 22:43:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-08 22:43:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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-01-08 22:43:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-01-08 22:43:34,339 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2025-01-08 22:43:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:34,339 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-01-08 22:43:34,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-01-08 22:43:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-01-08 22:43:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:43:34,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:34,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:34,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:43:34,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:34,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:34,342 INFO L85 PathProgramCache]: Analyzing trace with hash 678287510, now seen corresponding path program 1 times [2025-01-08 22:43:34,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:34,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713655494] [2025-01-08 22:43:34,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:43:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:34,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:43:34,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:43:34,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:43:34,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:34,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713655494] [2025-01-08 22:43:34,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713655494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:43:34,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:43:34,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:43:34,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553956708] [2025-01-08 22:43:34,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:43:34,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:43:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:34,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:43:34,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:43:34,538 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-01-08 22:43:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:34,591 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2025-01-08 22:43:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:43:34,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-01-08 22:43:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:34,593 INFO L225 Difference]: With dead ends: 25 [2025-01-08 22:43:34,593 INFO L226 Difference]: Without dead ends: 18 [2025-01-08 22:43:34,593 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-01-08 22:43:34,594 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:34,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:43:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-08 22:43:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-01-08 22:43:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-01-08 22:43:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-01-08 22:43:34,602 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2025-01-08 22:43:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:34,603 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-01-08 22:43:34,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-01-08 22:43:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-01-08 22:43:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-08 22:43:34,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:34,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:34,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:43:34,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:34,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:34,604 INFO L85 PathProgramCache]: Analyzing trace with hash -160962831, now seen corresponding path program 1 times [2025-01-08 22:43:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:34,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92940473] [2025-01-08 22:43:34,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:43:34,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:34,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:43:34,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:43:34,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:43:34,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:35,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:35,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92940473] [2025-01-08 22:43:35,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92940473] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:35,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720698691] [2025-01-08 22:43:35,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:43:35,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:35,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:35,536 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-01-08 22:43:35,537 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-01-08 22:43:35,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:43:35,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:43:35,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:43:35,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:35,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-08 22:43:35,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:35,677 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-01-08 22:43:35,832 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 19 treesize of output 11 [2025-01-08 22:43:35,930 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 19 treesize of output 11 [2025-01-08 22:43:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:35,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:36,093 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 35 treesize of output 31 [2025-01-08 22:43:36,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:36,104 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 44 treesize of output 44 [2025-01-08 22:43:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720698691] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:36,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:36,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-01-08 22:43:36,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426512894] [2025-01-08 22:43:36,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:36,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-08 22:43:36,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:36,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-08 22:43:36,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:43:36,225 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 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-01-08 22:43:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:36,597 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2025-01-08 22:43:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-08 22:43:36,597 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 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 15 [2025-01-08 22:43:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:36,599 INFO L225 Difference]: With dead ends: 40 [2025-01-08 22:43:36,599 INFO L226 Difference]: Without dead ends: 37 [2025-01-08 22:43:36,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2025-01-08 22:43:36,600 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:36,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 38 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:43:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-08 22:43:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2025-01-08 22:43:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 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-01-08 22:43:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-01-08 22:43:36,606 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2025-01-08 22:43:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:36,606 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-01-08 22:43:36,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 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-01-08 22:43:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-01-08 22:43:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-08 22:43:36,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:36,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:36,615 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-01-08 22:43:36,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:36,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:36,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1614044531, now seen corresponding path program 1 times [2025-01-08 22:43:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854749975] [2025-01-08 22:43:36,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:43:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:36,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:43:36,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:43:36,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:43:36,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:43:37,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:37,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854749975] [2025-01-08 22:43:37,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854749975] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:37,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298208641] [2025-01-08 22:43:37,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:43:37,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:37,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:37,024 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-01-08 22:43:37,027 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-01-08 22:43:37,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:43:37,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:43:37,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:43:37,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:37,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:43:37,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:37,113 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-01-08 22:43:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:43:37,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:37,163 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 14 treesize of output 12 [2025-01-08 22:43:37,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 12 [2025-01-08 22:43:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:43:37,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298208641] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:37,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:37,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-08 22:43:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117731246] [2025-01-08 22:43:37,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:37,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:43:37,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:37,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:43:37,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:43:37,186 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 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-01-08 22:43:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:37,248 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-01-08 22:43:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:43:37,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-08 22:43:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:37,249 INFO L225 Difference]: With dead ends: 35 [2025-01-08 22:43:37,249 INFO L226 Difference]: Without dead ends: 27 [2025-01-08 22:43:37,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:43:37,250 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:37,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:43:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-08 22:43:37,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-01-08 22:43:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 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-01-08 22:43:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-01-08 22:43:37,259 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2025-01-08 22:43:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:37,259 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-01-08 22:43:37,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 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-01-08 22:43:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-01-08 22:43:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:43:37,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:37,261 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:37,270 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-01-08 22:43:37,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:37,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:37,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1911496201, now seen corresponding path program 2 times [2025-01-08 22:43:37,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:37,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217000798] [2025-01-08 22:43:37,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:43:37,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:37,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-08 22:43:37,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:43:37,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:43:37,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:43:37,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217000798] [2025-01-08 22:43:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217000798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170459596] [2025-01-08 22:43:37,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:43:37,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:37,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:37,580 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-01-08 22:43:37,584 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-01-08 22:43:37,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-08 22:43:37,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:43:37,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:43:37,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:37,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:43:37,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:43:37,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:43:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170459596] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:37,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:37,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-08 22:43:37,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832742093] [2025-01-08 22:43:37,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:37,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:43:37,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:37,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:43:37,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:43:37,784 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-01-08 22:43:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:37,914 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-01-08 22:43:37,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:43:37,914 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-01-08 22:43:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:37,915 INFO L225 Difference]: With dead ends: 39 [2025-01-08 22:43:37,915 INFO L226 Difference]: Without dead ends: 34 [2025-01-08 22:43:37,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:43:37,916 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:37,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:43:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-08 22:43:37,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2025-01-08 22:43:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-01-08 22:43:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-01-08 22:43:37,922 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2025-01-08 22:43:37,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:37,922 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-01-08 22:43:37,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-01-08 22:43:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-01-08 22:43:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:43:37,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:37,923 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:37,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:43:38,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:38,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:38,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash -694942948, now seen corresponding path program 3 times [2025-01-08 22:43:38,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:38,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098752005] [2025-01-08 22:43:38,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:43:38,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:38,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-01-08 22:43:38,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:43:38,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:43:38,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:43:38,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098752005] [2025-01-08 22:43:38,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098752005] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630384979] [2025-01-08 22:43:38,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:43:38,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:38,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:38,216 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-01-08 22:43:38,218 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-01-08 22:43:38,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-01-08 22:43:38,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:43:38,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:43:38,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:38,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:43:38,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:43:38,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:43:38,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630384979] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:38,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:38,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-08 22:43:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402804432] [2025-01-08 22:43:38,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:38,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:43:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:38,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:43:38,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:43:38,372 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-01-08 22:43:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:38,436 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-01-08 22:43:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:43:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-08 22:43:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:38,437 INFO L225 Difference]: With dead ends: 38 [2025-01-08 22:43:38,437 INFO L226 Difference]: Without dead ends: 23 [2025-01-08 22:43:38,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:43:38,438 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:38,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:43:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-08 22:43:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-01-08 22:43:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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-01-08 22:43:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-01-08 22:43:38,446 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2025-01-08 22:43:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:38,446 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-01-08 22:43:38,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-01-08 22:43:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-01-08 22:43:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:43:38,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:38,449 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:38,459 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-01-08 22:43:38,650 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,SelfDestructingSolverStorable5 [2025-01-08 22:43:38,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:38,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:38,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2050929654, now seen corresponding path program 4 times [2025-01-08 22:43:38,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:38,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398007283] [2025-01-08 22:43:38,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:43:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:38,663 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-01-08 22:43:38,678 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:43:38,678 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:43:38,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:39,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:39,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398007283] [2025-01-08 22:43:39,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398007283] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:39,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471123970] [2025-01-08 22:43:39,689 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:43:39,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:39,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:39,691 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-01-08 22:43:39,694 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-01-08 22:43:39,744 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-01-08 22:43:39,767 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:43:39,767 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:43:39,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:39,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-08 22:43:39,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:39,780 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-01-08 22:43:39,940 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 19 treesize of output 11 [2025-01-08 22:43:40,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:40,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 26 treesize of output 21 [2025-01-08 22:43:40,202 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 19 treesize of output 11 [2025-01-08 22:43:40,247 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 19 treesize of output 11 [2025-01-08 22:43:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:40,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:40,680 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 78 treesize of output 70 [2025-01-08 22:43:40,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:40,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 386 treesize of output 383 [2025-01-08 22:43:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471123970] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:40,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2025-01-08 22:43:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775297027] [2025-01-08 22:43:40,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:40,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-08 22:43:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:40,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-08 22:43:40,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2025-01-08 22:43:40,949 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:44,822 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2025-01-08 22:43:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-01-08 22:43:44,822 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-08 22:43:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:44,823 INFO L225 Difference]: With dead ends: 98 [2025-01-08 22:43:44,823 INFO L226 Difference]: Without dead ends: 87 [2025-01-08 22:43:44,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3006 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1237, Invalid=8863, Unknown=0, NotChecked=0, Total=10100 [2025-01-08 22:43:44,828 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 107 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:44,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 131 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:43:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-08 22:43:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2025-01-08 22:43:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 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-01-08 22:43:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2025-01-08 22:43:44,847 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 20 [2025-01-08 22:43:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:44,848 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2025-01-08 22:43:44,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2025-01-08 22:43:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:43:44,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:44,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:44,855 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-01-08 22:43:45,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:45,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:45,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1241583028, now seen corresponding path program 1 times [2025-01-08 22:43:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15531603] [2025-01-08 22:43:45,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:43:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:43:45,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:43:45,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:43:45,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:43:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:45,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15531603] [2025-01-08 22:43:45,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15531603] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:45,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402268687] [2025-01-08 22:43:45,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:43:45,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:45,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:45,315 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-01-08 22:43:45,317 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-01-08 22:43:45,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:43:45,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:43:45,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:43:45,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:45,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-08 22:43:45,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:45,402 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-01-08 22:43:45,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:45,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 25 treesize of output 20 [2025-01-08 22:43:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:43:45,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:45,507 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 16 treesize of output 14 [2025-01-08 22:43:45,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2025-01-08 22:43:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:43:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402268687] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:45,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-08 22:43:45,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773361032] [2025-01-08 22:43:45,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:45,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-08 22:43:45,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:45,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-08 22:43:45,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:43:45,534 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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-01-08 22:43:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:45,615 INFO L93 Difference]: Finished difference Result 79 states and 110 transitions. [2025-01-08 22:43:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:43:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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) Word has length 20 [2025-01-08 22:43:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:45,617 INFO L225 Difference]: With dead ends: 79 [2025-01-08 22:43:45,617 INFO L226 Difference]: Without dead ends: 52 [2025-01-08 22:43:45,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:43:45,618 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:45,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:43:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-08 22:43:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2025-01-08 22:43:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 0 states have call successors, (0), 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-01-08 22:43:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2025-01-08 22:43:45,631 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 20 [2025-01-08 22:43:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:45,631 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2025-01-08 22:43:45,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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-01-08 22:43:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2025-01-08 22:43:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:43:45,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:45,632 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:45,639 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-01-08 22:43:45,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-08 22:43:45,832 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:45,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash -845752649, now seen corresponding path program 5 times [2025-01-08 22:43:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294373527] [2025-01-08 22:43:45,833 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:43:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:45,842 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-01-08 22:43:45,853 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:43:45,853 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-08 22:43:45,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:43:45,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:45,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294373527] [2025-01-08 22:43:45,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294373527] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:45,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570855578] [2025-01-08 22:43:45,934 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:43:45,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:45,936 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-01-08 22:43:45,939 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-01-08 22:43:45,985 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-01-08 22:43:46,006 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:43:46,007 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-08 22:43:46,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:46,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:43:46,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:43:46,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:43:46,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570855578] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:46,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:46,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-01-08 22:43:46,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975714846] [2025-01-08 22:43:46,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:46,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:43:46,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:46,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:43:46,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:43:46,105 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:46,216 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2025-01-08 22:43:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:43:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-08 22:43:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:46,218 INFO L225 Difference]: With dead ends: 69 [2025-01-08 22:43:46,218 INFO L226 Difference]: Without dead ends: 31 [2025-01-08 22:43:46,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:43:46,219 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:46,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:43:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-08 22:43:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2025-01-08 22:43:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-01-08 22:43:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-01-08 22:43:46,228 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-01-08 22:43:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:46,229 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-01-08 22:43:46,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-01-08 22:43:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:43:46,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:46,230 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:46,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 22:43:46,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:46,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:46,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:46,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1003071964, now seen corresponding path program 6 times [2025-01-08 22:43:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:46,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102434624] [2025-01-08 22:43:46,432 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:43:46,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:46,442 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 4 equivalence classes. [2025-01-08 22:43:46,469 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:43:46,470 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-08 22:43:46,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:43:46,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:46,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102434624] [2025-01-08 22:43:46,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102434624] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:46,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57062619] [2025-01-08 22:43:46,579 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:43:46,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:46,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:46,582 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-01-08 22:43:46,584 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-01-08 22:43:46,632 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 4 equivalence classes. [2025-01-08 22:43:46,659 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:43:46,660 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-08 22:43:46,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:46,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:43:46,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:43:46,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:43:46,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57062619] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:46,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:46,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-01-08 22:43:46,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251686478] [2025-01-08 22:43:46,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:46,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:43:46,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:46,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:43:46,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:43:46,784 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:46,885 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-01-08 22:43:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-08 22:43:46,886 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-08 22:43:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:46,886 INFO L225 Difference]: With dead ends: 31 [2025-01-08 22:43:46,886 INFO L226 Difference]: Without dead ends: 28 [2025-01-08 22:43:46,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:43:46,887 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:46,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 24 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:43:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-08 22:43:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-01-08 22:43:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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-01-08 22:43:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-01-08 22:43:46,893 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2025-01-08 22:43:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:46,893 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-01-08 22:43:46,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-01-08 22:43:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:43:46,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:46,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:46,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 22:43:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:47,095 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:47,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1030397329, now seen corresponding path program 7 times [2025-01-08 22:43:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012381394] [2025-01-08 22:43:47,096 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:43:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:47,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:43:47,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:43:47,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:43:47,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:48,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012381394] [2025-01-08 22:43:48,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012381394] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:48,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52155183] [2025-01-08 22:43:48,306 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:43:48,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:48,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:48,308 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:43:48,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 22:43:48,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:43:48,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:43:48,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:43:48,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:48,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-08 22:43:48,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:48,402 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-01-08 22:43:48,495 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 19 treesize of output 11 [2025-01-08 22:43:48,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:48,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 26 treesize of output 21 [2025-01-08 22:43:48,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:48,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-01-08 22:43:48,862 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 19 treesize of output 11 [2025-01-08 22:43:48,917 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 19 treesize of output 11 [2025-01-08 22:43:48,963 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 19 treesize of output 11 [2025-01-08 22:43:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:49,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:49,495 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 137 treesize of output 125 [2025-01-08 22:43:49,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:49,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11693 treesize of output 11111 [2025-01-08 22:43:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:49,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52155183] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:49,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:49,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 51 [2025-01-08 22:43:49,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661856668] [2025-01-08 22:43:49,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:49,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-08 22:43:49,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:49,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-08 22:43:49,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2277, Unknown=0, NotChecked=0, Total=2550 [2025-01-08 22:43:49,840 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:50,542 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-01-08 22:43:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-08 22:43:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 22:43:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:50,543 INFO L225 Difference]: With dead ends: 56 [2025-01-08 22:43:50,543 INFO L226 Difference]: Without dead ends: 47 [2025-01-08 22:43:50,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=379, Invalid=2927, Unknown=0, NotChecked=0, Total=3306 [2025-01-08 22:43:50,545 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:50,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 114 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:43:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-08 22:43:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2025-01-08 22:43:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 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-01-08 22:43:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-01-08 22:43:50,553 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-01-08 22:43:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:50,553 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-01-08 22:43:50,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-01-08 22:43:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:43:50,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:50,554 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:50,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-08 22:43:50,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:50,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:50,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:50,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1710455699, now seen corresponding path program 2 times [2025-01-08 22:43:50,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:50,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93187103] [2025-01-08 22:43:50,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:43:50,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:50,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-08 22:43:50,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:43:50,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:43:50,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:43:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93187103] [2025-01-08 22:43:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93187103] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:51,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102090634] [2025-01-08 22:43:51,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:43:51,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:51,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:51,115 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:43:51,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 22:43:51,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-08 22:43:51,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:43:51,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:43:51,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:51,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-08 22:43:51,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:51,216 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-01-08 22:43:51,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:51,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 25 treesize of output 20 [2025-01-08 22:43:51,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:51,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 25 treesize of output 20 [2025-01-08 22:43:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:43:51,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:51,429 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 16 treesize of output 14 [2025-01-08 22:43:51,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2025-01-08 22:43:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:43:51,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102090634] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:51,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:51,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2025-01-08 22:43:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890688004] [2025-01-08 22:43:51,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-08 22:43:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:51,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-08 22:43:51,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-01-08 22:43:51,463 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 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-01-08 22:43:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:51,595 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-01-08 22:43:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:43:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 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 25 [2025-01-08 22:43:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:51,596 INFO L225 Difference]: With dead ends: 51 [2025-01-08 22:43:51,596 INFO L226 Difference]: Without dead ends: 41 [2025-01-08 22:43:51,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2025-01-08 22:43:51,597 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:51,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 74 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:43:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-08 22:43:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-01-08 22:43:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 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-01-08 22:43:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-01-08 22:43:51,605 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2025-01-08 22:43:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:51,605 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-01-08 22:43:51,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 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-01-08 22:43:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-01-08 22:43:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:43:51,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:51,606 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:51,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-08 22:43:51,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 22:43:51,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:51,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash 464652567, now seen corresponding path program 8 times [2025-01-08 22:43:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060796726] [2025-01-08 22:43:51,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:43:51,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:51,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-08 22:43:51,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:43:51,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:43:51,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:43:51,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060796726] [2025-01-08 22:43:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060796726] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188661079] [2025-01-08 22:43:51,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:43:51,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:51,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:51,930 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:43:51,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 22:43:51,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-08 22:43:52,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:43:52,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:43:52,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:52,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:43:52,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:43:52,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:43:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188661079] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:52,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:52,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-01-08 22:43:52,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564781437] [2025-01-08 22:43:52,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:52,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-08 22:43:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:52,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-08 22:43:52,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:43:52,177 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 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-01-08 22:43:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:52,357 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-01-08 22:43:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-08 22:43:52,358 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-08 22:43:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:52,358 INFO L225 Difference]: With dead ends: 53 [2025-01-08 22:43:52,358 INFO L226 Difference]: Without dead ends: 46 [2025-01-08 22:43:52,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-01-08 22:43:52,359 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:52,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 33 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:43:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-08 22:43:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-01-08 22:43:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-01-08 22:43:52,373 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2025-01-08 22:43:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:52,373 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-01-08 22:43:52,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 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-01-08 22:43:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-01-08 22:43:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:43:52,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:52,374 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:52,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-08 22:43:52,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-08 22:43:52,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:52,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1162583794, now seen corresponding path program 3 times [2025-01-08 22:43:52,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:52,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448115467] [2025-01-08 22:43:52,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:43:52,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:52,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-01-08 22:43:52,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 29 statements. [2025-01-08 22:43:52,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:43:52,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:43:52,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:52,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448115467] [2025-01-08 22:43:52,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448115467] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:52,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608514815] [2025-01-08 22:43:52,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:43:52,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:52,697 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:43:52,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 22:43:52,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-01-08 22:43:52,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 29 statements. [2025-01-08 22:43:52,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:43:52,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:52,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:43:52,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:43:52,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:43:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608514815] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:52,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-01-08 22:43:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962806720] [2025-01-08 22:43:52,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:52,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-08 22:43:52,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:52,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-08 22:43:52,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:43:52,955 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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-01-08 22:43:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:53,064 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-01-08 22:43:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-08 22:43:53,065 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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) Word has length 29 [2025-01-08 22:43:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:53,065 INFO L225 Difference]: With dead ends: 57 [2025-01-08 22:43:53,065 INFO L226 Difference]: Without dead ends: 33 [2025-01-08 22:43:53,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:43:53,066 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:53,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 36 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:43:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-08 22:43:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-01-08 22:43:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 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-01-08 22:43:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-01-08 22:43:53,076 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2025-01-08 22:43:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:53,076 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-01-08 22:43:53,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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-01-08 22:43:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-01-08 22:43:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:43:53,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:53,079 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:53,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-08 22:43:53,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:53,283 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:53,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash 538687318, now seen corresponding path program 9 times [2025-01-08 22:43:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925669903] [2025-01-08 22:43:53,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:43:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:53,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-01-08 22:43:53,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:43:53,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-08 22:43:53,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:54,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925669903] [2025-01-08 22:43:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925669903] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018018314] [2025-01-08 22:43:54,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:43:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:54,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:54,844 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:43:54,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-08 22:43:54,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-01-08 22:43:54,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:43:54,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-08 22:43:54,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:54,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-08 22:43:54,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:54,971 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-01-08 22:43:55,048 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 19 treesize of output 11 [2025-01-08 22:43:55,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:55,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 26 treesize of output 21 [2025-01-08 22:43:55,267 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2025-01-08 22:43:55,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 41 [2025-01-08 22:43:55,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:55,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:55,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:55,492 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2025-01-08 22:43:55,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 51 [2025-01-08 22:43:55,788 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 19 treesize of output 11 [2025-01-08 22:43:55,873 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 19 treesize of output 11 [2025-01-08 22:43:55,959 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 25 treesize of output 17 [2025-01-08 22:43:56,049 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 19 treesize of output 11 [2025-01-08 22:43:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:43:56,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:57,183 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 193 treesize of output 177 [2025-01-08 22:43:57,333 INFO L349 Elim1Store]: treesize reduction 88, result has 47.9 percent of original size [2025-01-08 22:43:57,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 25156 treesize of output 22394 [2025-01-08 22:43:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:43:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018018314] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:58,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:58,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 64 [2025-01-08 22:43:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710939895] [2025-01-08 22:43:58,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:58,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-01-08 22:43:58,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:58,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-01-08 22:43:58,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=3544, Unknown=0, NotChecked=0, Total=4032 [2025-01-08 22:43:58,012 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 64 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 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-01-08 22:44:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:44:01,763 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2025-01-08 22:44:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-01-08 22:44:01,764 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 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 30 [2025-01-08 22:44:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:44:01,764 INFO L225 Difference]: With dead ends: 78 [2025-01-08 22:44:01,764 INFO L226 Difference]: Without dead ends: 75 [2025-01-08 22:44:01,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3772 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1527, Invalid=10683, Unknown=0, NotChecked=0, Total=12210 [2025-01-08 22:44:01,767 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 70 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:44:01,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 123 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:44:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-08 22:44:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2025-01-08 22:44:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2) internal successors, (66), 55 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-01-08 22:44:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-01-08 22:44:01,783 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 30 [2025-01-08 22:44:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:44:01,783 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-01-08 22:44:01,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 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-01-08 22:44:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-01-08 22:44:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:44:01,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:44:01,784 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:44:01,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-08 22:44:01,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:01,989 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:44:01,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:44:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash 145660308, now seen corresponding path program 4 times [2025-01-08 22:44:01,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:44:01,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538138341] [2025-01-08 22:44:01,989 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:44:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:44:01,997 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-01-08 22:44:02,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 30 statements. [2025-01-08 22:44:02,011 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:44:02,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:44:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:44:02,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538138341] [2025-01-08 22:44:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538138341] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:44:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099894997] [2025-01-08 22:44:02,246 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:44:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:44:02,248 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:44:02,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-08 22:44:02,319 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-01-08 22:44:02,336 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 30 statements. [2025-01-08 22:44:02,337 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:44:02,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:02,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-08 22:44:02,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:44:02,348 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 15 treesize of output 11 [2025-01-08 22:44:02,396 INFO L349 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2025-01-08 22:44:02,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 37 [2025-01-08 22:44:02,463 INFO L349 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2025-01-08 22:44:02,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 58 [2025-01-08 22:44:02,598 INFO L349 Elim1Store]: treesize reduction 35, result has 41.7 percent of original size [2025-01-08 22:44:02,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 80 [2025-01-08 22:44:02,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-08 22:44:02,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 12 [2025-01-08 22:44:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:44:02,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:44:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:44:02,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099894997] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:44:02,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:44:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 23 [2025-01-08 22:44:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763283899] [2025-01-08 22:44:02,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:44:02,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-08 22:44:02,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:44:02,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-08 22:44:02,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:44:02,852 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:44:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:44:03,479 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2025-01-08 22:44:03,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-08 22:44:03,480 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-08 22:44:03,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:44:03,481 INFO L225 Difference]: With dead ends: 86 [2025-01-08 22:44:03,481 INFO L226 Difference]: Without dead ends: 76 [2025-01-08 22:44:03,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=414, Invalid=1226, Unknown=0, NotChecked=0, Total=1640 [2025-01-08 22:44:03,482 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:44:03,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 45 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:44:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-08 22:44:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2025-01-08 22:44:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 0 states have call successors, (0), 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-01-08 22:44:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-01-08 22:44:03,501 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 30 [2025-01-08 22:44:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:44:03,501 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-01-08 22:44:03,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:44:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-01-08 22:44:03,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-08 22:44:03,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:44:03,501 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:44:03,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-08 22:44:03,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 22:44:03,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:44:03,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:44:03,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1923567288, now seen corresponding path program 5 times [2025-01-08 22:44:03,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:44:03,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277332617] [2025-01-08 22:44:03,702 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:44:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:44:03,710 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes. [2025-01-08 22:44:03,720 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:44:03,720 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-08 22:44:03,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:44:03,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:44:03,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277332617] [2025-01-08 22:44:03,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277332617] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:44:03,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055340877] [2025-01-08 22:44:03,835 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:44:03,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:03,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:44:03,838 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:44:03,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-08 22:44:03,904 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes. [2025-01-08 22:44:04,156 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:44:04,156 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-08 22:44:04,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:04,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:44:04,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:44:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:44:04,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:44:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:44:04,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055340877] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:44:04,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:44:04,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-01-08 22:44:04,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048846105] [2025-01-08 22:44:04,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:44:04,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-08 22:44:04,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:44:04,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-08 22:44:04,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:44:04,346 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 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-01-08 22:44:04,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:44:04,500 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2025-01-08 22:44:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:44:04,500 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 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 33 [2025-01-08 22:44:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:44:04,501 INFO L225 Difference]: With dead ends: 81 [2025-01-08 22:44:04,501 INFO L226 Difference]: Without dead ends: 43 [2025-01-08 22:44:04,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-01-08 22:44:04,502 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:44:04,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 31 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:44:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-08 22:44:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2025-01-08 22:44:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 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-01-08 22:44:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-01-08 22:44:04,516 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 33 [2025-01-08 22:44:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:44:04,516 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-01-08 22:44:04,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 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-01-08 22:44:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-01-08 22:44:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-08 22:44:04,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:44:04,517 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:44:04,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-08 22:44:04,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 22:44:04,718 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:44:04,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:44:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1931462460, now seen corresponding path program 10 times [2025-01-08 22:44:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:44:04,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375435029] [2025-01-08 22:44:04,718 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:44:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:44:04,727 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-01-08 22:44:04,732 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 34 statements. [2025-01-08 22:44:04,733 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:44:04,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:44:04,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:44:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375435029] [2025-01-08 22:44:04,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375435029] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:44:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108419684] [2025-01-08 22:44:04,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:44:04,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:04,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:44:04,845 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:44:04,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-08 22:44:04,916 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-01-08 22:44:04,933 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 34 statements. [2025-01-08 22:44:04,933 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:44:04,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:04,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:44:04,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:44:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:44:05,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:44:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:44:05,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108419684] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:44:05,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:44:05,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-01-08 22:44:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309485667] [2025-01-08 22:44:05,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:44:05,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-08 22:44:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:44:05,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-08 22:44:05,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:44:05,102 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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-01-08 22:44:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:44:05,243 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-01-08 22:44:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-08 22:44:05,243 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 34 [2025-01-08 22:44:05,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:44:05,244 INFO L225 Difference]: With dead ends: 44 [2025-01-08 22:44:05,244 INFO L226 Difference]: Without dead ends: 41 [2025-01-08 22:44:05,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2025-01-08 22:44:05,245 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 59 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:44:05,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 29 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:44:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-08 22:44:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2025-01-08 22:44:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 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-01-08 22:44:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-01-08 22:44:05,262 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 34 [2025-01-08 22:44:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:44:05,263 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-01-08 22:44:05,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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-01-08 22:44:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-01-08 22:44:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-08 22:44:05,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:44:05,264 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:44:05,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-08 22:44:05,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-08 22:44:05,465 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:44:05,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:44:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash -254268367, now seen corresponding path program 11 times [2025-01-08 22:44:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:44:05,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411071212] [2025-01-08 22:44:05,465 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:44:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:44:05,472 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-01-08 22:44:05,503 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:44:05,503 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-08 22:44:05,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:44:06,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:44:06,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411071212] [2025-01-08 22:44:06,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411071212] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:44:06,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666392747] [2025-01-08 22:44:06,919 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:44:06,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:06,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:44:06,921 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:44:06,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-08 22:44:06,988 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 6 equivalence classes. [2025-01-08 22:44:07,112 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:44:07,112 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-08 22:44:07,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:07,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-01-08 22:44:07,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:44:07,123 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-01-08 22:44:07,288 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 19 treesize of output 11 [2025-01-08 22:44:07,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:07,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 26 treesize of output 21 [2025-01-08 22:44:07,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:07,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-01-08 22:44:07,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:07,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-01-08 22:44:07,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:07,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 51 [2025-01-08 22:44:08,034 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 19 treesize of output 11 [2025-01-08 22:44:08,094 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 19 treesize of output 11 [2025-01-08 22:44:08,162 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 19 treesize of output 11 [2025-01-08 22:44:08,239 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 19 treesize of output 11 [2025-01-08 22:44:08,293 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 19 treesize of output 11 [2025-01-08 22:44:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:44:08,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:44:09,845 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 303 treesize of output 283 [2025-01-08 22:44:10,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:10,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 855695443 treesize of output 836821261 [2025-01-08 22:44:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:44:11,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666392747] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:44:11,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:44:11,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30, 30] total 79 [2025-01-08 22:44:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455360818] [2025-01-08 22:44:11,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:44:11,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-01-08 22:44:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:44:11,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-01-08 22:44:11,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=5514, Unknown=0, NotChecked=0, Total=6162 [2025-01-08 22:44:11,214 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 79 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 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-01-08 22:44:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:44:14,726 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-01-08 22:44:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-08 22:44:14,726 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 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 35 [2025-01-08 22:44:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:44:14,727 INFO L225 Difference]: With dead ends: 81 [2025-01-08 22:44:14,727 INFO L226 Difference]: Without dead ends: 78 [2025-01-08 22:44:14,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3309 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1232, Invalid=9480, Unknown=0, NotChecked=0, Total=10712 [2025-01-08 22:44:14,730 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 177 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:44:14,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 157 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 22:44:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-08 22:44:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2025-01-08 22:44:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:44:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-01-08 22:44:14,760 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 35 [2025-01-08 22:44:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:44:14,761 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-01-08 22:44:14,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 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-01-08 22:44:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-01-08 22:44:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-08 22:44:14,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:44:14,761 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:44:14,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-08 22:44:14,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:14,962 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:44:14,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:44:14,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1265385617, now seen corresponding path program 6 times [2025-01-08 22:44:14,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:44:14,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964670291] [2025-01-08 22:44:14,962 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:44:14,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:44:14,969 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-01-08 22:44:14,998 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:44:14,998 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-08 22:44:14,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:44:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:44:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964670291] [2025-01-08 22:44:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964670291] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:44:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451958297] [2025-01-08 22:44:15,405 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:44:15,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:15,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:44:15,407 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:44:15,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-08 22:44:15,495 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-01-08 22:44:15,571 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:44:15,572 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-08 22:44:15,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:15,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-08 22:44:15,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:44:15,634 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-01-08 22:44:15,655 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-01-08 22:44:15,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:15,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 30 [2025-01-08 22:44:15,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:15,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 30 [2025-01-08 22:44:15,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:15,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 30 [2025-01-08 22:44:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:44:15,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:44:16,004 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 24 treesize of output 22 [2025-01-08 22:44:16,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 21 [2025-01-08 22:44:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:44:16,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451958297] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:44:16,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:44:16,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 16] total 39 [2025-01-08 22:44:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024325878] [2025-01-08 22:44:16,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:44:16,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-08 22:44:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:44:16,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-08 22:44:16,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2025-01-08 22:44:16,088 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 states have internal predecessors, (73), 0 states have call successors, (0), 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-01-08 22:44:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:44:16,828 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2025-01-08 22:44:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-08 22:44:16,829 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 states have internal predecessors, (73), 0 states have call successors, (0), 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 35 [2025-01-08 22:44:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:44:16,829 INFO L225 Difference]: With dead ends: 77 [2025-01-08 22:44:16,829 INFO L226 Difference]: Without dead ends: 62 [2025-01-08 22:44:16,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=563, Invalid=3597, Unknown=0, NotChecked=0, Total=4160 [2025-01-08 22:44:16,830 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:44:16,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:44:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-08 22:44:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2025-01-08 22:44:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 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-01-08 22:44:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-01-08 22:44:16,848 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 35 [2025-01-08 22:44:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:44:16,848 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-01-08 22:44:16,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 39 states have internal predecessors, (73), 0 states have call successors, (0), 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-01-08 22:44:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-01-08 22:44:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-08 22:44:16,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:44:16,849 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:44:16,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-08 22:44:17,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:17,049 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:44:17,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:44:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash 707552732, now seen corresponding path program 12 times [2025-01-08 22:44:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:44:17,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968695647] [2025-01-08 22:44:17,050 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:44:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:44:17,057 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 6 equivalence classes. [2025-01-08 22:44:17,082 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:44:17,083 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-08 22:44:17,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-08 22:44:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:44:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968695647] [2025-01-08 22:44:17,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968695647] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:44:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117794925] [2025-01-08 22:44:17,239 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:44:17,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:17,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:44:17,241 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:44:17,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-08 22:44:17,329 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 6 equivalence classes. [2025-01-08 22:44:17,421 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:44:17,421 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-08 22:44:17,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:17,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-08 22:44:17,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:44:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-08 22:44:17,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:44:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-08 22:44:17,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117794925] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:44:17,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:44:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2025-01-08 22:44:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181541024] [2025-01-08 22:44:17,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:44:17,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-08 22:44:17,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:44:17,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-08 22:44:17,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:44:17,665 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:44:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:44:17,872 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2025-01-08 22:44:17,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-08 22:44:17,872 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-08 22:44:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:44:17,873 INFO L225 Difference]: With dead ends: 115 [2025-01-08 22:44:17,873 INFO L226 Difference]: Without dead ends: 66 [2025-01-08 22:44:17,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2025-01-08 22:44:17,874 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:44:17,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 73 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:44:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-08 22:44:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2025-01-08 22:44:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 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-01-08 22:44:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2025-01-08 22:44:17,890 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 36 [2025-01-08 22:44:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:44:17,890 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-01-08 22:44:17,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:44:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2025-01-08 22:44:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-08 22:44:17,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:44:17,891 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:44:17,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-01-08 22:44:18,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:18,091 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:44:18,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:44:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1462428342, now seen corresponding path program 13 times [2025-01-08 22:44:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:44:18,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488605337] [2025-01-08 22:44:18,092 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:44:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:44:18,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-08 22:44:18,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-08 22:44:18,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:44:18,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:44:20,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:44:20,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488605337] [2025-01-08 22:44:20,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488605337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:44:20,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014736345] [2025-01-08 22:44:20,771 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:44:20,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:20,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:44:20,773 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:44:20,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-08 22:44:20,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-08 22:44:20,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-08 22:44:20,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:44:20,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:20,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-01-08 22:44:20,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:44:20,885 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-01-08 22:44:20,994 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 19 treesize of output 11 [2025-01-08 22:44:21,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:21,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 26 treesize of output 21 [2025-01-08 22:44:21,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:21,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-01-08 22:44:21,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:21,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-01-08 22:44:21,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:21,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 51 [2025-01-08 22:44:21,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:21,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 61 [2025-01-08 22:44:21,996 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 19 treesize of output 11 [2025-01-08 22:44:22,068 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 19 treesize of output 11 [2025-01-08 22:44:22,144 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 19 treesize of output 11 [2025-01-08 22:44:22,212 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 19 treesize of output 11 [2025-01-08 22:44:22,290 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 19 treesize of output 11 [2025-01-08 22:44:22,367 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 19 treesize of output 11 [2025-01-08 22:44:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:44:22,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:44:24,627 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 410 treesize of output 386 [2025-01-08 22:44:25,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:25,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 1739730883822 treesize of output 1716108563971 [2025-01-08 22:44:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:44:27,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014736345] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:44:27,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:44:27,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 93 [2025-01-08 22:44:27,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861152321] [2025-01-08 22:44:27,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:44:27,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-01-08 22:44:27,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:44:27,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-01-08 22:44:27,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=7855, Unknown=0, NotChecked=0, Total=8556 [2025-01-08 22:44:27,939 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 93 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 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-01-08 22:44:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:44:30,417 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2025-01-08 22:44:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-08 22:44:30,417 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 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 40 [2025-01-08 22:44:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:44:30,418 INFO L225 Difference]: With dead ends: 102 [2025-01-08 22:44:30,418 INFO L226 Difference]: Without dead ends: 84 [2025-01-08 22:44:30,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3027 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=894, Invalid=9206, Unknown=0, NotChecked=0, Total=10100 [2025-01-08 22:44:30,420 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:44:30,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 198 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-08 22:44:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-08 22:44:30,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2025-01-08 22:44:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.16) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 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-01-08 22:44:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-01-08 22:44:30,447 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 40 [2025-01-08 22:44:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:44:30,447 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-01-08 22:44:30,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 1.086021505376344) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 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-01-08 22:44:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-01-08 22:44:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-08 22:44:30,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:44:30,448 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:44:30,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-08 22:44:30,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:30,649 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:44:30,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:44:30,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1276787312, now seen corresponding path program 14 times [2025-01-08 22:44:30,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:44:30,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170969420] [2025-01-08 22:44:30,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:44:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:44:30,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-08 22:44:30,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:44:30,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:44:30,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:44:30,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:44:30,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170969420] [2025-01-08 22:44:30,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170969420] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:44:30,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482042159] [2025-01-08 22:44:30,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:44:30,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:30,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:44:30,835 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:44:30,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-08 22:44:30,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-08 22:44:30,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:44:30,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:44:30,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:30,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-08 22:44:30,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:44:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:44:31,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:44:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:44:31,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482042159] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:44:31,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:44:31,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2025-01-08 22:44:31,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751737041] [2025-01-08 22:44:31,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:44:31,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-08 22:44:31,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:44:31,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-08 22:44:31,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-01-08 22:44:31,191 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 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-01-08 22:44:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:44:31,524 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2025-01-08 22:44:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-08 22:44:31,524 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-08 22:44:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:44:31,525 INFO L225 Difference]: With dead ends: 107 [2025-01-08 22:44:31,525 INFO L226 Difference]: Without dead ends: 97 [2025-01-08 22:44:31,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2025-01-08 22:44:31,525 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:44:31,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 38 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:44:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-08 22:44:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2025-01-08 22:44:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:44:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2025-01-08 22:44:31,545 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 41 [2025-01-08 22:44:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:44:31,545 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-01-08 22:44:31,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 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-01-08 22:44:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2025-01-08 22:44:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-08 22:44:31,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:44:31,546 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:44:31,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-08 22:44:31,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-08 22:44:31,746 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:44:31,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:44:31,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1337290031, now seen corresponding path program 15 times [2025-01-08 22:44:31,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:44:31,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780882606] [2025-01-08 22:44:31,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:44:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:44:31,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 8 equivalence classes. [2025-01-08 22:44:31,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:44:31,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-08 22:44:31,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 3 proven. 120 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:44:34,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:44:34,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780882606] [2025-01-08 22:44:34,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780882606] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:44:34,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561479138] [2025-01-08 22:44:34,936 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:44:34,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:44:34,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:44:34,939 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:44:34,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-08 22:44:35,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 8 equivalence classes. [2025-01-08 22:44:35,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:44:35,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-08 22:44:35,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:44:35,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-01-08 22:44:35,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:44:35,270 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-01-08 22:44:35,280 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-01-08 22:44:35,319 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-01-08 22:44:35,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:35,369 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 28 treesize of output 30 [2025-01-08 22:44:35,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:35,465 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 37 treesize of output 42 [2025-01-08 22:44:35,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:35,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2025-01-08 22:44:35,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:35,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:35,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 66 [2025-01-08 22:44:52,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:52,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 69 treesize of output 79 [2025-01-08 22:44:52,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:52,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 69 treesize of output 79 [2025-01-08 22:44:52,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:52,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:44:52,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 69 treesize of output 79 [2025-01-08 22:44:53,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:44:53,139 INFO L349 Elim1Store]: treesize reduction 148, result has 36.8 percent of original size [2025-01-08 22:44:53,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 80 treesize of output 119