./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-sorted-1.i --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/forester-heap/sll-sorted-1.i -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 e45b14428dafe2f20aeac8c38d2592befc15b6791b0365935474ded4fd47d0f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:45:08,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:45:08,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:45:08,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:45:08,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:45:08,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:45:08,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:45:08,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:45:08,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:45:08,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:45:08,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:45:08,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:45:08,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:45:08,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:45:08,342 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:45:08,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:45:08,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:45:08,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:45:08,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:45:08,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:45:08,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:45:08,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:45:08,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:45:08,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:45:08,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:45:08,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:45:08,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:45:08,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:45:08,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:45:08,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:45:08,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:45:08,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:45:08,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:45:08,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:45:08,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:45:08,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:45:08,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:45:08,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:45:08,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:45:08,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:45:08,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:45:08,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:45:08,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:45:08,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:45:08,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:45:08,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:45:08,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:45:08,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:45:08,347 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 -> e45b14428dafe2f20aeac8c38d2592befc15b6791b0365935474ded4fd47d0f2 [2025-01-09 02:45:08,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:45:08,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:45:08,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:45:08,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:45:08,617 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:45:08,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-1.i [2025-01-09 02:45:09,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f3c6bd0d/e6b502677e8e4753841bbe4f204eeffe/FLAGe42d95310 [2025-01-09 02:45:10,147 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:45:10,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i [2025-01-09 02:45:10,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f3c6bd0d/e6b502677e8e4753841bbe4f204eeffe/FLAGe42d95310 [2025-01-09 02:45:10,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f3c6bd0d/e6b502677e8e4753841bbe4f204eeffe [2025-01-09 02:45:10,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:45:10,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:45:10,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:45:10,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:45:10,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:45:10,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260f7198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10, skipping insertion in model container [2025-01-09 02:45:10,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:45:10,743 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/forester-heap/sll-sorted-1.i[22317,22330] [2025-01-09 02:45:10,751 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/forester-heap/sll-sorted-1.i[22547,22560] [2025-01-09 02:45:10,755 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/forester-heap/sll-sorted-1.i[22877,22890] [2025-01-09 02:45:10,758 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/forester-heap/sll-sorted-1.i[22941,22954] [2025-01-09 02:45:10,759 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/forester-heap/sll-sorted-1.i[23072,23085] [2025-01-09 02:45:10,760 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/forester-heap/sll-sorted-1.i[23136,23149] [2025-01-09 02:45:10,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:45:10,775 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:45:10,821 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/forester-heap/sll-sorted-1.i[22317,22330] [2025-01-09 02:45:10,823 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/forester-heap/sll-sorted-1.i[22547,22560] [2025-01-09 02:45:10,831 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/forester-heap/sll-sorted-1.i[22877,22890] [2025-01-09 02:45:10,831 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/forester-heap/sll-sorted-1.i[22941,22954] [2025-01-09 02:45:10,832 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/forester-heap/sll-sorted-1.i[23072,23085] [2025-01-09 02:45:10,833 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/forester-heap/sll-sorted-1.i[23136,23149] [2025-01-09 02:45:10,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:45:10,858 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:45:10,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10 WrapperNode [2025-01-09 02:45:10,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:45:10,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:45:10,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:45:10,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:45:10,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,909 INFO L138 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 172 [2025-01-09 02:45:10,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:45:10,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:45:10,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:45:10,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:45:10,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,936 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2025-01-09 02:45:10,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:45:10,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:45:10,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:45:10,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:45:10,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (1/1) ... [2025-01-09 02:45:10,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:45:10,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:10,978 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-09 02:45:10,981 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-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:45:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:45:11,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:45:11,112 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:45:11,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:45:11,325 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-09 02:45:11,325 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:45:11,338 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:45:11,339 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-09 02:45:11,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:11 BoogieIcfgContainer [2025-01-09 02:45:11,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:45:11,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:45:11,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:45:11,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:45:11,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:45:10" (1/3) ... [2025-01-09 02:45:11,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed9c46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:11, skipping insertion in model container [2025-01-09 02:45:11,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:10" (2/3) ... [2025-01-09 02:45:11,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed9c46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:11, skipping insertion in model container [2025-01-09 02:45:11,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:11" (3/3) ... [2025-01-09 02:45:11,349 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-sorted-1.i [2025-01-09 02:45:11,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:45:11,361 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-sorted-1.i that has 1 procedures, 58 locations, 1 initial locations, 12 loop locations, and 6 error locations. [2025-01-09 02:45:11,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:45:11,413 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;@40b75d6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:45:11,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 02:45:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 57 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-09 02:45:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 02:45:11,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:11,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 02:45:11,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:45:11,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash 890184070, now seen corresponding path program 1 times [2025-01-09 02:45:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439347054] [2025-01-09 02:45:11,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:11,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 02:45:11,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 02:45:11,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:11,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:11,589 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-09 02:45:11,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:11,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439347054] [2025-01-09 02:45:11,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439347054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:45:11,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:45:11,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:45:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218992821] [2025-01-09 02:45:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:45:11,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:45:11,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:11,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:45:11,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:45:11,615 INFO L87 Difference]: Start difference. First operand has 58 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 57 states have internal predecessors, (91), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-09 02:45:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:11,633 INFO L93 Difference]: Finished difference Result 109 states and 171 transitions. [2025-01-09 02:45:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:45:11,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-01-09 02:45:11,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:11,641 INFO L225 Difference]: With dead ends: 109 [2025-01-09 02:45:11,641 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 02:45:11,644 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-09 02:45:11,648 INFO L435 NwaCegarLoop]: 69 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, 69 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-09 02:45:11,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:45:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 02:45:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-09 02:45:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-01-09 02:45:11,684 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 6 [2025-01-09 02:45:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:11,685 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-01-09 02:45:11,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-09 02:45:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-01-09 02:45:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 02:45:11,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:11,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:11,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:45:11,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:45:11,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1805966454, now seen corresponding path program 1 times [2025-01-09 02:45:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:11,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748098351] [2025-01-09 02:45:11,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:11,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:11,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 02:45:11,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 02:45:11,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:11,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:11,770 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-09 02:45:11,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748098351] [2025-01-09 02:45:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748098351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:45:11,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:45:11,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:45:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486940234] [2025-01-09 02:45:11,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:45:11,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:45:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:11,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:45:11,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:45:11,773 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 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-09 02:45:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:11,808 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2025-01-09 02:45:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:45:11,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-01-09 02:45:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:11,809 INFO L225 Difference]: With dead ends: 116 [2025-01-09 02:45:11,809 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 02:45:11,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:45:11,810 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:11,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:45:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 02:45:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2025-01-09 02:45:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.320754716981132) internal successors, (70), 58 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-01-09 02:45:11,816 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 7 [2025-01-09 02:45:11,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:11,816 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-01-09 02:45:11,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 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-09 02:45:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-01-09 02:45:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 02:45:11,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:11,819 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:11,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:45:11,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:45:11,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1021013716, now seen corresponding path program 1 times [2025-01-09 02:45:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110881234] [2025-01-09 02:45:11,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:11,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 02:45:11,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:45:11,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:11,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 02:45:11,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:11,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110881234] [2025-01-09 02:45:11,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110881234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:45:12,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:45:12,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:45:12,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423138383] [2025-01-09 02:45:12,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:45:12,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:45:12,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:12,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:45:12,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:45:12,001 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:12,112 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2025-01-09 02:45:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:45:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 02:45:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:12,115 INFO L225 Difference]: With dead ends: 94 [2025-01-09 02:45:12,115 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 02:45:12,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:45:12,116 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 142 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:12,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 72 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:45:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 02:45:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2025-01-09 02:45:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 56 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-09 02:45:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-01-09 02:45:12,133 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 12 [2025-01-09 02:45:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:12,133 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-01-09 02:45:12,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-01-09 02:45:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 02:45:12,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:12,135 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:12,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:45:12,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:45:12,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash 711932215, now seen corresponding path program 1 times [2025-01-09 02:45:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:12,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683035717] [2025-01-09 02:45:12,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:12,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:12,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 02:45:12,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:45:12,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:12,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:13,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:13,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683035717] [2025-01-09 02:45:13,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683035717] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:45:13,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811421837] [2025-01-09 02:45:13,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:13,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:13,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:13,036 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-09 02:45:13,037 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-09 02:45:13,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 02:45:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:45:13,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:13,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:13,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 02:45:13,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:45:13,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:45:13,245 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 02:45:13,265 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:13,265 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:13,279 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 5 treesize of output 3 [2025-01-09 02:45:13,290 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 02:45:13,309 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:13,309 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:13,333 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:45:13,334 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 11 treesize of output 11 [2025-01-09 02:45:13,390 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:45:13,390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-09 02:45:13,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:45:13,407 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 24 treesize of output 11 [2025-01-09 02:45:13,611 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 27 treesize of output 15 [2025-01-09 02:45:13,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-01-09 02:45:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:13,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:45:13,716 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 69 treesize of output 49 [2025-01-09 02:45:13,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:13,794 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-01-09 02:45:13,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:13,801 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2025-01-09 02:45:13,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:13,813 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 64 treesize of output 47 [2025-01-09 02:45:13,821 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 29 treesize of output 27 [2025-01-09 02:45:13,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:13,839 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 48 treesize of output 51 [2025-01-09 02:45:13,848 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 35 treesize of output 33 [2025-01-09 02:45:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:13,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811421837] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:45:13,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:45:13,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-01-09 02:45:13,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429781308] [2025-01-09 02:45:13,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:45:13,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 02:45:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:13,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 02:45:13,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=200, Unknown=1, NotChecked=0, Total=240 [2025-01-09 02:45:13,979 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-09 02:45:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:14,403 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2025-01-09 02:45:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:45:14,403 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 02:45:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:14,405 INFO L225 Difference]: With dead ends: 111 [2025-01-09 02:45:14,407 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 02:45:14,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=340, Unknown=1, NotChecked=0, Total=420 [2025-01-09 02:45:14,408 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 155 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:14,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 403 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:45:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 02:45:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 77. [2025-01-09 02:45:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 76 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 02:45:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2025-01-09 02:45:14,425 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 23 [2025-01-09 02:45:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:14,425 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2025-01-09 02:45:14,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-09 02:45:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2025-01-09 02:45:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:45:14,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:14,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:14,437 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-09 02:45:14,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:14,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:45:14,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1429083614, now seen corresponding path program 1 times [2025-01-09 02:45:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:14,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185389062] [2025-01-09 02:45:14,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:14,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:45:14,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:45:14,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:14,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:15,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:15,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185389062] [2025-01-09 02:45:15,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185389062] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:45:15,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917025247] [2025-01-09 02:45:15,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:15,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:15,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:15,234 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-09 02:45:15,237 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-09 02:45:15,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:45:15,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:45:15,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:15,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:15,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 02:45:15,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:45:15,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:45:15,408 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 02:45:15,423 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:15,423 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:15,437 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 02:45:15,451 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:15,451 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:15,461 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 5 treesize of output 3 [2025-01-09 02:45:15,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:45:15,477 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 11 treesize of output 11 [2025-01-09 02:45:15,538 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:45:15,539 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-01-09 02:45:15,546 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 24 treesize of output 11 [2025-01-09 02:45:15,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:45:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:15,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:45:15,758 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 69 treesize of output 49 [2025-01-09 02:45:15,765 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_202 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_201 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2025-01-09 02:45:15,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:15,788 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-01-09 02:45:15,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:15,797 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-01-09 02:45:15,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:15,809 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 64 treesize of output 47 [2025-01-09 02:45:15,814 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 29 treesize of output 27 [2025-01-09 02:45:15,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:15,828 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 48 treesize of output 51 [2025-01-09 02:45:15,834 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 35 treesize of output 33 [2025-01-09 02:45:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:15,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917025247] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:45:15,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:45:15,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-01-09 02:45:15,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60902288] [2025-01-09 02:45:15,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:45:15,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 02:45:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:15,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 02:45:15,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=204, Unknown=1, NotChecked=28, Total=272 [2025-01-09 02:45:15,953 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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-09 02:45:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:16,489 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2025-01-09 02:45:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:45:16,490 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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 27 [2025-01-09 02:45:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:16,490 INFO L225 Difference]: With dead ends: 141 [2025-01-09 02:45:16,491 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 02:45:16,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=412, Unknown=1, NotChecked=42, Total=552 [2025-01-09 02:45:16,492 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 155 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:16,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 564 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 318 Invalid, 0 Unknown, 79 Unchecked, 0.3s Time] [2025-01-09 02:45:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 02:45:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2025-01-09 02:45:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 02:45:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2025-01-09 02:45:16,500 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 27 [2025-01-09 02:45:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:16,500 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2025-01-09 02:45:16,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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-09 02:45:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2025-01-09 02:45:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 02:45:16,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:16,501 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:16,511 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-09 02:45:16,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:16,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:45:16,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1825227245, now seen corresponding path program 2 times [2025-01-09 02:45:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:16,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630594239] [2025-01-09 02:45:16,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:45:16,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:16,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 02:45:16,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:45:16,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:45:16,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:17,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:17,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630594239] [2025-01-09 02:45:17,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630594239] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:45:17,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196350279] [2025-01-09 02:45:17,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:45:17,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:17,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:17,479 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-09 02:45:17,481 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-09 02:45:17,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 02:45:17,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:45:17,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:45:17,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:17,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-01-09 02:45:17,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:45:17,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:45:17,638 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:45:17,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:45:17,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2025-01-09 02:45:17,650 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 16 treesize of output 11 [2025-01-09 02:45:17,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2025-01-09 02:45:17,660 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 16 treesize of output 11 [2025-01-09 02:45:17,694 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 16 treesize of output 11 [2025-01-09 02:45:17,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 02:45:17,707 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 16 treesize of output 11 [2025-01-09 02:45:17,801 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 02:45:17,801 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 75 [2025-01-09 02:45:17,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:45:17,808 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 90 treesize of output 71 [2025-01-09 02:45:17,817 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:45:17,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-01-09 02:45:17,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2025-01-09 02:45:17,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-01-09 02:45:17,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:45:17,851 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:17,852 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:17,863 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-01-09 02:45:17,864 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 54 [2025-01-09 02:45:17,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-09 02:45:17,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:45:17,931 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 36 treesize of output 27 [2025-01-09 02:45:18,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 35 treesize of output 19 [2025-01-09 02:45:18,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 02:45:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:18,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:45:18,348 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_327 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)) 1)) is different from false [2025-01-09 02:45:18,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:18,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2025-01-09 02:45:18,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:18,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2025-01-09 02:45:18,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:18,472 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 51 [2025-01-09 02:45:18,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:18,483 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 86 treesize of output 85 [2025-01-09 02:45:18,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:18,500 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 38 treesize of output 40 [2025-01-09 02:45:18,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:18,859 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 210 [2025-01-09 02:45:18,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:18,869 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 242 [2025-01-09 02:45:18,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:18,884 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 584 treesize of output 419 [2025-01-09 02:45:18,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:18,909 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 628 treesize of output 611 [2025-01-09 02:45:18,933 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 479 treesize of output 477 [2025-01-09 02:45:18,943 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 477 treesize of output 473 [2025-01-09 02:45:18,954 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 473 treesize of output 471 [2025-01-09 02:45:18,965 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 471 treesize of output 469 [2025-01-09 02:45:18,975 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 469 treesize of output 467 [2025-01-09 02:45:18,987 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 467 treesize of output 463 [2025-01-09 02:45:18,999 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 463 treesize of output 459 [2025-01-09 02:45:19,010 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 459 treesize of output 455 [2025-01-09 02:45:19,020 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 455 treesize of output 451 [2025-01-09 02:45:19,031 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 451 treesize of output 449 [2025-01-09 02:45:19,041 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 449 treesize of output 445 [2025-01-09 02:45:19,052 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 445 treesize of output 443 [2025-01-09 02:45:19,064 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 443 treesize of output 439 [2025-01-09 02:45:19,087 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 439 treesize of output 437 [2025-01-09 02:45:19,098 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 437 treesize of output 433 [2025-01-09 02:45:19,108 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 433 treesize of output 425 [2025-01-09 02:45:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 02:45:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196350279] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:45:20,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:45:20,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2025-01-09 02:45:20,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44392631] [2025-01-09 02:45:20,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:45:20,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 02:45:20,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:20,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 02:45:20,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=355, Unknown=2, NotChecked=38, Total=462 [2025-01-09 02:45:20,043 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 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-09 02:45:25,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 02:45:26,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 02:45:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:29,686 INFO L93 Difference]: Finished difference Result 209 states and 260 transitions. [2025-01-09 02:45:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 02:45:29,686 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 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) Word has length 28 [2025-01-09 02:45:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:29,687 INFO L225 Difference]: With dead ends: 209 [2025-01-09 02:45:29,687 INFO L226 Difference]: Without dead ends: 153 [2025-01-09 02:45:29,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=164, Invalid=890, Unknown=6, NotChecked=62, Total=1122 [2025-01-09 02:45:29,689 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 204 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 22 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:29,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 905 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 689 Invalid, 10 Unknown, 145 Unchecked, 8.4s Time] [2025-01-09 02:45:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-09 02:45:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 90. [2025-01-09 02:45:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 89 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-09 02:45:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2025-01-09 02:45:29,703 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 28 [2025-01-09 02:45:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:29,703 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2025-01-09 02:45:29,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 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-09 02:45:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2025-01-09 02:45:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 02:45:29,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:29,704 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:29,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 02:45:29,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:29,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:45:29,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:29,905 INFO L85 PathProgramCache]: Analyzing trace with hash 238643629, now seen corresponding path program 1 times [2025-01-09 02:45:29,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:29,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900834783] [2025-01-09 02:45:29,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:29,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:29,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 02:45:29,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:45:29,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:29,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:31,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:31,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900834783] [2025-01-09 02:45:31,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900834783] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:45:31,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110195849] [2025-01-09 02:45:31,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:31,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:31,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:31,536 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-09 02:45:31,537 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-09 02:45:31,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 02:45:31,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:45:31,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:31,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:31,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 02:45:31,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:45:31,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:45:31,869 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 02:45:31,940 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:31,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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:31,948 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 5 treesize of output 3 [2025-01-09 02:45:31,969 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 02:45:32,030 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:32,030 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:32,132 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:45:32,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:45:32,317 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 16 treesize of output 11 [2025-01-09 02:45:32,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 02:45:32,379 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 16 treesize of output 11 [2025-01-09 02:45:32,692 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 02:45:32,692 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 86 [2025-01-09 02:45:32,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:45:32,708 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 113 treesize of output 88 [2025-01-09 02:45:32,769 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:32,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 15 [2025-01-09 02:45:32,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 26 [2025-01-09 02:45:32,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 15 [2025-01-09 02:45:32,899 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:45:32,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-01-09 02:45:32,988 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:32,989 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:33,023 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-01-09 02:45:33,023 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 48 [2025-01-09 02:45:33,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:45:33,261 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 36 treesize of output 27 [2025-01-09 02:45:33,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:45:33,677 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 20 treesize of output 12 [2025-01-09 02:45:33,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-01-09 02:45:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:33,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:45:34,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_451) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_452) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)) 0)) is different from false [2025-01-09 02:45:34,186 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_62| Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_449 Int) (v_ArrVal_444 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_62|) 0)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_444) |v_ULTIMATE.start_main_~x~0#1.base_62| v_ArrVal_451) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_449)) |v_ULTIMATE.start_main_~x~0#1.base_62| v_ArrVal_452) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_448) |v_ULTIMATE.start_main_~x~0#1.base_62| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)) 0) (not (= v_ArrVal_444 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_444 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2025-01-09 02:45:34,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:34,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2025-01-09 02:45:34,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:34,312 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 186 treesize of output 190 [2025-01-09 02:45:34,323 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 158 treesize of output 130 [2025-01-09 02:45:34,357 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 17 treesize of output 3 [2025-01-09 02:45:34,424 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 120 treesize of output 106 [2025-01-09 02:45:35,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:35,130 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 162 [2025-01-09 02:45:35,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:35,159 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 214 [2025-01-09 02:45:35,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:35,217 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 1092 treesize of output 739 [2025-01-09 02:45:35,244 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 361 treesize of output 359 [2025-01-09 02:45:35,261 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 359 treesize of output 357 [2025-01-09 02:45:35,278 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 357 treesize of output 353 [2025-01-09 02:45:35,295 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 353 treesize of output 345 [2025-01-09 02:45:35,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:35,378 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 392 treesize of output 395 [2025-01-09 02:45:35,400 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 379 treesize of output 375 [2025-01-09 02:45:35,417 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 375 treesize of output 373 [2025-01-09 02:45:35,434 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 373 treesize of output 369 [2025-01-09 02:45:35,451 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 369 treesize of output 365 [2025-01-09 02:45:35,469 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 365 treesize of output 357 [2025-01-09 02:45:35,485 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 357 treesize of output 353 [2025-01-09 02:45:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-01-09 02:45:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110195849] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:45:38,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:45:38,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2025-01-09 02:45:38,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180672133] [2025-01-09 02:45:38,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:45:38,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 02:45:38,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:38,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 02:45:38,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=481, Unknown=2, NotChecked=90, Total=650 [2025-01-09 02:45:38,163 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:42,520 INFO L93 Difference]: Finished difference Result 187 states and 235 transitions. [2025-01-09 02:45:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 02:45:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-09 02:45:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:42,522 INFO L225 Difference]: With dead ends: 187 [2025-01-09 02:45:42,522 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 02:45:42,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=232, Invalid=1256, Unknown=2, NotChecked=150, Total=1640 [2025-01-09 02:45:42,523 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 141 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:42,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 972 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 753 Invalid, 0 Unknown, 222 Unchecked, 2.7s Time] [2025-01-09 02:45:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 02:45:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 109. [2025-01-09 02:45:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 108 states have internal predecessors, (134), 0 states have call successors, (0), 0 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-09 02:45:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2025-01-09 02:45:42,536 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 28 [2025-01-09 02:45:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:42,536 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2025-01-09 02:45:42,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2025-01-09 02:45:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 02:45:42,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:42,538 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:42,546 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-09 02:45:42,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 02:45:42,742 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:45:42,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1306119994, now seen corresponding path program 1 times [2025-01-09 02:45:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523478706] [2025-01-09 02:45:42,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:42,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:45:42,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:45:42,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:42,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523478706] [2025-01-09 02:45:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523478706] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:45:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232836418] [2025-01-09 02:45:43,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:43,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:43,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:43,705 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-09 02:45:43,707 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-09 02:45:43,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:45:43,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:45:43,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:43,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:43,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 02:45:43,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:45:43,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:45:44,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2025-01-09 02:45:44,082 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:44,083 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:44,097 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 5 treesize of output 3 [2025-01-09 02:45:44,204 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:45:44,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 02:45:44,478 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:45:44,478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-01-09 02:45:45,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:45:45,092 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 12 [2025-01-09 02:45:45,117 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:45:45,117 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 11 treesize of output 11 [2025-01-09 02:45:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:45,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:45:45,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.base_10| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~tmp~0#1.base_10| v_ArrVal_561) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_10|) 0)))) is different from false [2025-01-09 02:45:45,429 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.base_10| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_10|) 0)) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~tmp~0#1.base_10| v_ArrVal_561) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))) is different from false [2025-01-09 02:45:45,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:45,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-01-09 02:45:45,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:45,902 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 185 treesize of output 144 [2025-01-09 02:45:45,918 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 52 treesize of output 50 [2025-01-09 02:45:45,927 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 50 treesize of output 46 [2025-01-09 02:45:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 02:45:46,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232836418] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:45:46,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:45:46,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2025-01-09 02:45:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183360566] [2025-01-09 02:45:46,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:45:46,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 02:45:46,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:46,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 02:45:46,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=292, Unknown=3, NotChecked=70, Total=420 [2025-01-09 02:45:46,656 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 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-09 02:45:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:49,315 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2025-01-09 02:45:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:45:49,315 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 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) Word has length 29 [2025-01-09 02:45:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:49,316 INFO L225 Difference]: With dead ends: 271 [2025-01-09 02:45:49,316 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 02:45:49,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=164, Invalid=653, Unknown=3, NotChecked=110, Total=930 [2025-01-09 02:45:49,318 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 550 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:49,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 760 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 458 Invalid, 0 Unknown, 337 Unchecked, 1.6s Time] [2025-01-09 02:45:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 02:45:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 119. [2025-01-09 02:45:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 118 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-09 02:45:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2025-01-09 02:45:49,331 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 29 [2025-01-09 02:45:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:49,331 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2025-01-09 02:45:49,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 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-09 02:45:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2025-01-09 02:45:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 02:45:49,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:49,332 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:49,340 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-09 02:45:49,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:49,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:45:49,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:49,536 INFO L85 PathProgramCache]: Analyzing trace with hash -626061624, now seen corresponding path program 1 times [2025-01-09 02:45:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:49,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390490543] [2025-01-09 02:45:49,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:49,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:49,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:45:49,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:45:49,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:49,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390490543] [2025-01-09 02:45:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390490543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:45:50,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090347119] [2025-01-09 02:45:50,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:50,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:50,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:50,869 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-09 02:45:50,872 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-09 02:45:50,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:45:51,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:45:51,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:51,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:51,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 02:45:51,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:45:51,038 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-09 02:45:51,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:45:51,336 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 35 treesize of output 18 [2025-01-09 02:45:51,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:45:51,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 11 [2025-01-09 02:45:51,391 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:45:51,391 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 26 treesize of output 14 [2025-01-09 02:45:51,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:45:51,451 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 11 treesize of output 11 [2025-01-09 02:45:51,598 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 16 treesize of output 11 [2025-01-09 02:45:52,032 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:52,032 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:52,079 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 20 treesize of output 16 [2025-01-09 02:45:52,104 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 20 treesize of output 16 [2025-01-09 02:45:52,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:45:52,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:45:52,239 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 30 treesize of output 27 [2025-01-09 02:45:52,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 15 [2025-01-09 02:45:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:52,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:45:52,643 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 41 treesize of output 37 [2025-01-09 02:45:52,664 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 37 treesize of output 33 [2025-01-09 02:45:52,732 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_13| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_main_~tmp~0#1.base_13| v_ArrVal_686) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_687) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0) (= |v_ULTIMATE.start_main_~tmp~0#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_687 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_687 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_13| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~tmp~0#1.base_13| v_ArrVal_686))) (or (not (= v_ArrVal_687 (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_687 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_687) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0))))))) is different from false [2025-01-09 02:45:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090347119] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:45:53,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:45:53,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2025-01-09 02:45:53,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682781083] [2025-01-09 02:45:53,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:45:53,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 02:45:53,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:53,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 02:45:53,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=299, Unknown=7, NotChecked=36, Total=420 [2025-01-09 02:45:53,696 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:55,247 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2025-01-09 02:45:55,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 02:45:55,248 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 02:45:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:55,249 INFO L225 Difference]: With dead ends: 181 [2025-01-09 02:45:55,249 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 02:45:55,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=166, Invalid=533, Unknown=7, NotChecked=50, Total=756 [2025-01-09 02:45:55,249 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 304 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:55,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 503 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 334 Invalid, 0 Unknown, 102 Unchecked, 1.1s Time] [2025-01-09 02:45:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 02:45:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 133. [2025-01-09 02:45:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.265625) internal successors, (162), 132 states have internal predecessors, (162), 0 states have call successors, (0), 0 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-09 02:45:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2025-01-09 02:45:55,265 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 29 [2025-01-09 02:45:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:55,265 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2025-01-09 02:45:55,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2025-01-09 02:45:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 02:45:55,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:55,266 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:55,275 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-09 02:45:55,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 02:45:55,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:45:55,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash -622767734, now seen corresponding path program 1 times [2025-01-09 02:45:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:55,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768009086] [2025-01-09 02:45:55,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:55,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:45:55,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:45:55,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:55,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768009086] [2025-01-09 02:45:56,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768009086] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:45:56,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994578636] [2025-01-09 02:45:56,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:56,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:56,637 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-09 02:45:56,639 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-09 02:45:56,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:45:56,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:45:56,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:56,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:56,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 02:45:56,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:45:56,816 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-09 02:45:56,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:45:56,992 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-01-09 02:45:57,047 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:57,047 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:57,145 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 02:45:57,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 02:45:57,361 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 16 treesize of output 11 [2025-01-09 02:45:57,872 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:57,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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:57,940 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:45:57,941 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 11 treesize of output 11 [2025-01-09 02:45:58,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:45:58,044 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 26 treesize of output 23 [2025-01-09 02:45:58,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 11 [2025-01-09 02:45:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:58,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:46:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:46:07,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994578636] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:46:07,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:46:07,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2025-01-09 02:46:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971865210] [2025-01-09 02:46:07,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:46:07,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 02:46:07,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:46:07,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 02:46:07,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=475, Unknown=12, NotChecked=0, Total=600 [2025-01-09 02:46:07,607 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-09 02:46:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:46:09,220 INFO L93 Difference]: Finished difference Result 171 states and 202 transitions. [2025-01-09 02:46:09,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 02:46:09,220 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 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-09 02:46:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:46:09,221 INFO L225 Difference]: With dead ends: 171 [2025-01-09 02:46:09,221 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 02:46:09,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=192, Invalid=666, Unknown=12, NotChecked=0, Total=870 [2025-01-09 02:46:09,222 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 324 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:46:09,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 526 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 362 Invalid, 1 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 02:46:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 02:46:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 133. [2025-01-09 02:46:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.2578125) internal successors, (161), 132 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-09 02:46:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2025-01-09 02:46:09,236 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 29 [2025-01-09 02:46:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:46:09,236 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2025-01-09 02:46:09,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-09 02:46:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2025-01-09 02:46:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 02:46:09,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:46:09,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:46:09,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 02:46:09,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:46:09,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 02:46:09,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:46:09,438 INFO L85 PathProgramCache]: Analyzing trace with hash 319736888, now seen corresponding path program 1 times [2025-01-09 02:46:09,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:46:09,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338624543] [2025-01-09 02:46:09,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:46:09,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:46:09,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 02:46:09,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 02:46:09,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:46:09,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:46:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:46:10,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:46:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338624543] [2025-01-09 02:46:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338624543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:46:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367371698] [2025-01-09 02:46:10,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:46:10,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:46:10,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:46:10,442 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-09 02:46:10,443 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-09 02:46:10,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 02:46:10,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 02:46:10,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:46:10,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:46:10,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 02:46:10,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:46:10,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:46:10,837 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-01-09 02:46:10,838 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 1 case distinctions, treesize of input 27 treesize of output 19 [2025-01-09 02:46:10,924 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:46:10,924 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 11 treesize of output 11 [2025-01-09 02:46:10,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:46:11,140 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:46:11,140 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2025-01-09 02:46:11,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2025-01-09 02:46:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:46:12,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:46:17,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:46:17,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 25962 treesize of output 23423 [2025-01-09 02:46:21,504 INFO L349 Elim1Store]: treesize reduction 496, result has 51.8 percent of original size [2025-01-09 02:46:21,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 16 new quantified variables, introduced 79 case distinctions, treesize of input 22128 treesize of output 21157 [2025-01-09 02:46:23,354 INFO L224 Elim1Store]: Index analysis took 115 ms [2025-01-09 02:46:23,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:46:23,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 6611 treesize of output 6703 [2025-01-09 02:46:33,025 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 6 treesize of output 4