./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/packet_filter.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/heap-data/packet_filter.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 d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:40:18,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:40:18,831 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:40:18,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:40:18,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:40:18,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:40:18,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:40:18,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:40:18,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:40:18,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:40:18,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:40:18,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:40:18,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:40:18,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:40:18,864 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:40:18,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:40:18,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:40:18,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:40:18,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:40:18,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:40:18,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:40:18,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:40:18,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:40:18,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:40:18,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:40:18,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:40:18,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:40:18,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:40:18,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:40:18,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:40:18,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:40:18,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:40:18,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:40:18,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:40:18,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:40:18,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:40:18,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:40:18,867 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 -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2025-01-09 02:40:19,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:40:19,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:40:19,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:40:19,154 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:40:19,154 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:40:19,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2025-01-09 02:40:20,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0f43fccd/1f43022daf4b4830bf83cff63c6a9211/FLAG4d2ab5cbf [2025-01-09 02:40:20,901 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:40:20,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2025-01-09 02:40:20,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0f43fccd/1f43022daf4b4830bf83cff63c6a9211/FLAG4d2ab5cbf [2025-01-09 02:40:20,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0f43fccd/1f43022daf4b4830bf83cff63c6a9211 [2025-01-09 02:40:20,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:40:20,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:40:20,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:40:20,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:40:20,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:40:20,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:40:20" (1/1) ... [2025-01-09 02:40:20,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:20, skipping insertion in model container [2025-01-09 02:40:20,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:40:20" (1/1) ... [2025-01-09 02:40:20,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:40:21,270 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/heap-data/packet_filter.i[23925,23938] [2025-01-09 02:40:21,282 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/heap-data/packet_filter.i[24159,24172] [2025-01-09 02:40:21,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:40:21,301 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:40:21,337 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/heap-data/packet_filter.i[23925,23938] [2025-01-09 02:40:21,340 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/heap-data/packet_filter.i[24159,24172] [2025-01-09 02:40:21,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:40:21,381 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:40:21,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21 WrapperNode [2025-01-09 02:40:21,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:40:21,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:40:21,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:40:21,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:40:21,389 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:40:21" (1/1) ... [2025-01-09 02:40:21,404 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:40:21" (1/1) ... [2025-01-09 02:40:21,430 INFO L138 Inliner]: procedures = 130, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2025-01-09 02:40:21,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:40:21,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:40:21,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:40:21,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:40:21,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,466 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 15, 6, 6, 6, 16, 6]. 28 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 3, 2, 0, 0, 0, 0]. The 14 writes are split as follows [0, 0, 1, 3, 3, 4, 3]. [2025-01-09 02:40:21,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:40:21,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:40:21,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:40:21,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:40:21,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (1/1) ... [2025-01-09 02:40:21,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:40:21,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:21,529 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:40:21,535 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:40:21,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:40:21,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:40:21,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:40:21,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 02:40:21,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 02:40:21,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 02:40:21,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 02:40:21,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:40:21,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:40:21,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:40:21,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2025-01-09 02:40:21,560 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 02:40:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure send [2025-01-09 02:40:21,561 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 02:40:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 02:40:21,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 02:40:21,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:40:21,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:40:21,709 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:40:21,712 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:40:21,987 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-01-09 02:40:21,987 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:40:21,997 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:40:21,997 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:40:21,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:21 BoogieIcfgContainer [2025-01-09 02:40:21,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:40:22,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:40:22,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:40:22,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:40:22,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:40:20" (1/3) ... [2025-01-09 02:40:22,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4558f8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:40:22, skipping insertion in model container [2025-01-09 02:40:22,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:40:21" (2/3) ... [2025-01-09 02:40:22,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4558f8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:40:22, skipping insertion in model container [2025-01-09 02:40:22,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:40:21" (3/3) ... [2025-01-09 02:40:22,007 INFO L128 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2025-01-09 02:40:22,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:40:22,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG packet_filter.i that has 3 procedures, 44 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-01-09 02:40:22,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:40:22,073 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;@59c685a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:40:22,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 02:40:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 36 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:40:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 02:40:22,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:22,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:22,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:22,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1062802487, now seen corresponding path program 1 times [2025-01-09 02:40:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:22,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469945819] [2025-01-09 02:40:22,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:22,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:22,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 02:40:22,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 02:40:22,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:22,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:22,254 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:40:22,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:22,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469945819] [2025-01-09 02:40:22,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469945819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:22,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:22,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:40:22,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191229399] [2025-01-09 02:40:22,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:22,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:40:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:22,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:40:22,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:40:22,283 INFO L87 Difference]: Start difference. First operand has 44 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 36 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 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:40:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:22,301 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2025-01-09 02:40:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:40:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-01-09 02:40:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:22,307 INFO L225 Difference]: With dead ends: 69 [2025-01-09 02:40:22,308 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 02:40:22,312 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:40:22,315 INFO L435 NwaCegarLoop]: 54 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, 54 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:40:22,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:40:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 02:40:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 02:40:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:40:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-01-09 02:40:22,349 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 8 [2025-01-09 02:40:22,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:22,349 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-01-09 02:40:22,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 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:40:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2025-01-09 02:40:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 02:40:22,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:22,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:22,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:40:22,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:22,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:22,353 INFO L85 PathProgramCache]: Analyzing trace with hash -504918517, now seen corresponding path program 1 times [2025-01-09 02:40:22,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:22,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137768564] [2025-01-09 02:40:22,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:22,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:22,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 02:40:22,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 02:40:22,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:22,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:22,590 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:40:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137768564] [2025-01-09 02:40:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137768564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:22,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:22,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:40:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447288884] [2025-01-09 02:40:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:22,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:40:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:22,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:40:22,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:40:22,593 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:40:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:22,664 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2025-01-09 02:40:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:40:22,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 02:40:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:22,666 INFO L225 Difference]: With dead ends: 73 [2025-01-09 02:40:22,667 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 02:40:22,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:40:22,669 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:22,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 133 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:40:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 02:40:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2025-01-09 02:40:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:40:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2025-01-09 02:40:22,680 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 9 [2025-01-09 02:40:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:22,681 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-01-09 02:40:22,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:40:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2025-01-09 02:40:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:40:22,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:22,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:22,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:40:22,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:22,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash 665685455, now seen corresponding path program 1 times [2025-01-09 02:40:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950743274] [2025-01-09 02:40:22,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:22,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:40:22,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:40:22,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:22,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:22,860 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:40:22,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:22,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950743274] [2025-01-09 02:40:22,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950743274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:22,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:22,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:40:22,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149345467] [2025-01-09 02:40:22,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:22,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:40:22,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:22,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:40:22,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:40:22,861 INFO L87 Difference]: Start difference. First operand 48 states and 60 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:40:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:22,936 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2025-01-09 02:40:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:40:22,937 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 11 [2025-01-09 02:40:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:22,938 INFO L225 Difference]: With dead ends: 66 [2025-01-09 02:40:22,938 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 02:40:22,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:40:22,939 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:22,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 135 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:40:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 02:40:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2025-01-09 02:40:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:40:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2025-01-09 02:40:22,950 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 11 [2025-01-09 02:40:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:22,951 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2025-01-09 02:40:22,951 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:40:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2025-01-09 02:40:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 02:40:22,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:22,951 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] [2025-01-09 02:40:22,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:40:22,952 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:22,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1384961011, now seen corresponding path program 1 times [2025-01-09 02:40:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:22,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635420595] [2025-01-09 02:40:22,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:23,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 02:40:23,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:40:23,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:23,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:23,113 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:40:23,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:23,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635420595] [2025-01-09 02:40:23,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635420595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:23,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:23,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:40:23,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605952715] [2025-01-09 02:40:23,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:23,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:40:23,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:23,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:40:23,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:40:23,115 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:23,131 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2025-01-09 02:40:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:40:23,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-09 02:40:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:23,132 INFO L225 Difference]: With dead ends: 49 [2025-01-09 02:40:23,132 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 02:40:23,132 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:40:23,133 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:23,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:40:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 02:40:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-09 02:40:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:40:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-01-09 02:40:23,145 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 21 [2025-01-09 02:40:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:23,146 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-01-09 02:40:23,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-01-09 02:40:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 02:40:23,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:23,147 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] [2025-01-09 02:40:23,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:40:23,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:23,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1384962933, now seen corresponding path program 1 times [2025-01-09 02:40:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367949236] [2025-01-09 02:40:23,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:23,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 02:40:23,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:40:23,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:23,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:24,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:24,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367949236] [2025-01-09 02:40:24,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367949236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:24,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:40:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270053343] [2025-01-09 02:40:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:24,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:40:24,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:24,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:40:24,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:40:24,634 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:25,437 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2025-01-09 02:40:25,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 02:40:25,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-09 02:40:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:25,439 INFO L225 Difference]: With dead ends: 89 [2025-01-09 02:40:25,439 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 02:40:25,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-09 02:40:25,440 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:25,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 309 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:40:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 02:40:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2025-01-09 02:40:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:40:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-01-09 02:40:25,447 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 21 [2025-01-09 02:40:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:25,447 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-01-09 02:40:25,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-01-09 02:40:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 02:40:25,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:25,448 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] [2025-01-09 02:40:25,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:40:25,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:25,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash 518082518, now seen corresponding path program 1 times [2025-01-09 02:40:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:25,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386237735] [2025-01-09 02:40:25,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:25,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 02:40:25,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 02:40:25,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:25,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:26,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:26,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386237735] [2025-01-09 02:40:26,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386237735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:26,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:26,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:40:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986461511] [2025-01-09 02:40:26,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:26,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:40:26,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:26,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:40:26,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:40:26,191 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:26,597 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2025-01-09 02:40:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 02:40:26,598 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-09 02:40:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:26,600 INFO L225 Difference]: With dead ends: 77 [2025-01-09 02:40:26,600 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 02:40:26,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:40:26,601 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:26,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 380 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:40:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 02:40:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2025-01-09 02:40:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 57 states have internal predecessors, (73), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:40:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2025-01-09 02:40:26,611 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 22 [2025-01-09 02:40:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:26,611 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2025-01-09 02:40:26,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2025-01-09 02:40:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 02:40:26,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:26,613 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] [2025-01-09 02:40:26,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:40:26,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:26,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1123868266, now seen corresponding path program 1 times [2025-01-09 02:40:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:26,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364734245] [2025-01-09 02:40:26,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:26,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 02:40:26,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 02:40:26,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:26,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:26,982 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:40:26,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364734245] [2025-01-09 02:40:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364734245] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687055374] [2025-01-09 02:40:26,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:26,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:26,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:26,987 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:40:26,989 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:40:27,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 02:40:27,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 02:40:27,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:27,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:27,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 02:40:27,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:27,231 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 10 treesize of output 8 [2025-01-09 02:40:27,718 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse2 .cse3) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse3))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4)))))))) is different from false [2025-01-09 02:40:27,731 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse2 .cse3) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse3))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4)))))))) is different from true [2025-01-09 02:40:27,812 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:40:27,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:27,903 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_381 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2025-01-09 02:40:27,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687055374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:27,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:40:27,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2025-01-09 02:40:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904687707] [2025-01-09 02:40:27,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:27,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 02:40:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:27,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 02:40:27,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=30, Unknown=3, NotChecked=22, Total=72 [2025-01-09 02:40:27,907 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:40:28,111 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) .cse2) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse3 .cse4) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse5))))))) .cse2)) is different from false [2025-01-09 02:40:28,117 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) .cse2) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse3 .cse4) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse5))))))) .cse2)) is different from true [2025-01-09 02:40:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:28,148 INFO L93 Difference]: Finished difference Result 105 states and 140 transitions. [2025-01-09 02:40:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:40:28,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 02:40:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:28,151 INFO L225 Difference]: With dead ends: 105 [2025-01-09 02:40:28,151 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 02:40:28,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=30, Unknown=5, NotChecked=36, Total=90 [2025-01-09 02:40:28,152 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:28,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 198 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 92 Unchecked, 0.2s Time] [2025-01-09 02:40:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 02:40:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2025-01-09 02:40:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 68 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:40:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2025-01-09 02:40:28,168 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 22 [2025-01-09 02:40:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:28,169 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2025-01-09 02:40:28,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:40:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2025-01-09 02:40:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 02:40:28,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:28,171 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:40:28,181 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:40:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:28,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:28,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash 68745655, now seen corresponding path program 1 times [2025-01-09 02:40:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727882739] [2025-01-09 02:40:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:28,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 02:40:28,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:40:28,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:28,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:28,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:28,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727882739] [2025-01-09 02:40:28,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727882739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:28,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:28,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:40:28,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219164133] [2025-01-09 02:40:28,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:28,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:40:28,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:28,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:40:28,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:40:28,591 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:28,735 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2025-01-09 02:40:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:40:28,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 02:40:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:28,736 INFO L225 Difference]: With dead ends: 99 [2025-01-09 02:40:28,736 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 02:40:28,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:40:28,737 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 15 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:28,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 196 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:40:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 02:40:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2025-01-09 02:40:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 68 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:40:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2025-01-09 02:40:28,745 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 23 [2025-01-09 02:40:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:28,745 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2025-01-09 02:40:28,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2025-01-09 02:40:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:40:28,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:28,748 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] [2025-01-09 02:40:28,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 02:40:28,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:28,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:28,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1441383528, now seen corresponding path program 1 times [2025-01-09 02:40:28,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:28,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002547990] [2025-01-09 02:40:28,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:28,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:28,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:40:28,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:40:28,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:28,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:29,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:29,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002547990] [2025-01-09 02:40:29,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002547990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:29,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:29,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 02:40:29,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006546182] [2025-01-09 02:40:29,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:29,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:40:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:29,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:40:29,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:40:29,548 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:30,267 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2025-01-09 02:40:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 02:40:30,268 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-09 02:40:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:30,269 INFO L225 Difference]: With dead ends: 116 [2025-01-09 02:40:30,269 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 02:40:30,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-01-09 02:40:30,270 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 25 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:30,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 466 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:40:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 02:40:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2025-01-09 02:40:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 77 states have internal predecessors, (98), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 02:40:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2025-01-09 02:40:30,279 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 24 [2025-01-09 02:40:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:30,280 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2025-01-09 02:40:30,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2025-01-09 02:40:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:40:30,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:30,281 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] [2025-01-09 02:40:30,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 02:40:30,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:30,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1441385450, now seen corresponding path program 1 times [2025-01-09 02:40:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:30,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901872951] [2025-01-09 02:40:30,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:30,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:40:30,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:40:30,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:30,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:30,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901872951] [2025-01-09 02:40:30,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901872951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:40:30,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:40:30,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 02:40:30,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978579285] [2025-01-09 02:40:30,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:40:30,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:40:30,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:30,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:40:30,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:40:30,750 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:31,108 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2025-01-09 02:40:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 02:40:31,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-09 02:40:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:31,110 INFO L225 Difference]: With dead ends: 100 [2025-01-09 02:40:31,110 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 02:40:31,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 02:40:31,111 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 20 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:31,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 413 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:40:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 02:40:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2025-01-09 02:40:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 78 states have internal predecessors, (99), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 02:40:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2025-01-09 02:40:31,121 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 24 [2025-01-09 02:40:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:31,121 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2025-01-09 02:40:31,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:40:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2025-01-09 02:40:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 02:40:31,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:31,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:31,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 02:40:31,123 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:31,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1897531638, now seen corresponding path program 1 times [2025-01-09 02:40:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:31,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402134745] [2025-01-09 02:40:31,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:31,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 02:40:31,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 02:40:31,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:31,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:31,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402134745] [2025-01-09 02:40:31,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402134745] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:31,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523930711] [2025-01-09 02:40:31,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:31,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:31,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:31,715 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:40:31,717 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:40:31,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 02:40:31,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 02:40:31,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:31,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:31,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 02:40:31,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:32,006 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 30 treesize of output 31 [2025-01-09 02:40:32,014 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 30 treesize of output 31 [2025-01-09 02:40:32,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:40:32,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:40:32,048 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_13 Int)) (let ((.cse2 (select |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base|)) (.cse0 (select |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_13))) (and (= (store |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base| (store .cse0 v_append_to_queue_~q.offset_13 .cse1)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_13 0)) |c_#memory_$Pointer$#2.offset|) (= (select (select |c_#memory_$Pointer$#5.offset| .cse1) 12) (select .cse2 v_append_to_queue_~q.offset_13)) (= (select .cse0 v_append_to_queue_~q.offset_13) (select (select |c_#memory_$Pointer$#5.base| .cse1) 12))))) is different from true [2025-01-09 02:40:32,114 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2025-01-09 02:40:32,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2025-01-09 02:40:32,145 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-01-09 02:40:32,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2025-01-09 02:40:32,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:40:32,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 102 [2025-01-09 02:40:32,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:40:32,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 114 [2025-01-09 02:40:33,116 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:40:33,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:33,410 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 229 treesize of output 209 [2025-01-09 02:40:33,419 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 540 treesize of output 500 [2025-01-09 02:40:33,427 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 251 treesize of output 247 [2025-01-09 02:40:33,433 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 247 treesize of output 243 [2025-01-09 02:40:33,728 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:40:33,730 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 80 treesize of output 60 [2025-01-09 02:40:33,736 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 30 treesize of output 26 [2025-01-09 02:40:33,756 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 426 treesize of output 386 [2025-01-09 02:40:33,764 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 112 treesize of output 108 [2025-01-09 02:40:33,829 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 426 treesize of output 386 [2025-01-09 02:40:33,838 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 112 treesize of output 108 [2025-01-09 02:40:33,905 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:40:33,907 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 80 treesize of output 60 [2025-01-09 02:40:33,913 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 30 treesize of output 26 [2025-01-09 02:40:34,073 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:40:34,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523930711] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:40:34,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:40:34,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 18 [2025-01-09 02:40:34,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975512763] [2025-01-09 02:40:34,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:34,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 02:40:34,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:34,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 02:40:34,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2025-01-09 02:40:34,078 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:40:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:34,911 INFO L93 Difference]: Finished difference Result 158 states and 207 transitions. [2025-01-09 02:40:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:40:34,912 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2025-01-09 02:40:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:34,913 INFO L225 Difference]: With dead ends: 158 [2025-01-09 02:40:34,913 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 02:40:34,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=315, Unknown=1, NotChecked=36, Total=420 [2025-01-09 02:40:34,914 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 68 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:34,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 461 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 254 Invalid, 0 Unknown, 129 Unchecked, 0.6s Time] [2025-01-09 02:40:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 02:40:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2025-01-09 02:40:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.2660550458715596) internal successors, (138), 110 states have internal predecessors, (138), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 02:40:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2025-01-09 02:40:34,936 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 30 [2025-01-09 02:40:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:34,936 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2025-01-09 02:40:34,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:40:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2025-01-09 02:40:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:40:34,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:34,937 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, 1, 1, 1] [2025-01-09 02:40:34,947 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:40:35,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:35,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:35,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:35,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1273967880, now seen corresponding path program 1 times [2025-01-09 02:40:35,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:35,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077009225] [2025-01-09 02:40:35,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:35,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:35,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:40:35,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:40:35,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:35,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:40:35,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:35,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077009225] [2025-01-09 02:40:35,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077009225] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:35,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625719499] [2025-01-09 02:40:35,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:35,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:35,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:35,463 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:40:35,466 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:40:35,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:40:35,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:40:35,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:35,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:35,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 02:40:35,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:35,707 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 10 treesize of output 8 [2025-01-09 02:40:35,849 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) is different from false [2025-01-09 02:40:35,853 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) is different from true [2025-01-09 02:40:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:40:35,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:36,068 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_980 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_979 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2025-01-09 02:40:36,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625719499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:36,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:40:36,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 9 [2025-01-09 02:40:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976498110] [2025-01-09 02:40:36,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:36,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:40:36,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:36,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:40:36,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=40, Unknown=3, NotChecked=26, Total=90 [2025-01-09 02:40:36,072 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:40:36,292 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) .cse0 (or (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse1))))) .cse0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2025-01-09 02:40:36,294 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) .cse0 (or (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse1))))) .cse0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from true [2025-01-09 02:40:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:36,465 INFO L93 Difference]: Finished difference Result 201 states and 257 transitions. [2025-01-09 02:40:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:40:36,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-01-09 02:40:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:36,467 INFO L225 Difference]: With dead ends: 201 [2025-01-09 02:40:36,467 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 02:40:36,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=65, Unknown=5, NotChecked=54, Total=156 [2025-01-09 02:40:36,468 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:36,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 285 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 0 Unknown, 122 Unchecked, 0.3s Time] [2025-01-09 02:40:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 02:40:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2025-01-09 02:40:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 122 states have internal predecessors, (154), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 02:40:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 178 transitions. [2025-01-09 02:40:36,489 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 178 transitions. Word has length 32 [2025-01-09 02:40:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:36,490 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 178 transitions. [2025-01-09 02:40:36,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:40:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 178 transitions. [2025-01-09 02:40:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 02:40:36,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:36,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:36,501 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:40:36,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:36,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:36,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1585071796, now seen corresponding path program 1 times [2025-01-09 02:40:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:36,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964058586] [2025-01-09 02:40:36,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:36,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:36,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 02:40:36,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 02:40:36,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:36,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:37,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964058586] [2025-01-09 02:40:37,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964058586] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:37,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114371278] [2025-01-09 02:40:37,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:37,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:37,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:37,243 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:40:37,246 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:40:37,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 02:40:37,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 02:40:37,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:37,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:37,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 02:40:37,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:37,543 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 30 treesize of output 31 [2025-01-09 02:40:37,551 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 34 treesize of output 15 [2025-01-09 02:40:37,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:40:37,570 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_21 Int)) (let ((.cse0 (select |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base|)) (.cse2 (select |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_21))) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base| (store .cse0 v_append_to_queue_~q.offset_21 0))) (= (select (select |c_#memory_$Pointer$#5.base| .cse1) 12) (select .cse2 v_append_to_queue_~q.offset_21)) (= (select .cse0 v_append_to_queue_~q.offset_21) (select (select |c_#memory_$Pointer$#5.offset| .cse1) 12)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_21 .cse1)) |c_#memory_$Pointer$#2.base|)))) is different from true [2025-01-09 02:40:37,634 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-01-09 02:40:37,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2025-01-09 02:40:37,654 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2025-01-09 02:40:37,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2025-01-09 02:40:38,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:40:38,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 102 [2025-01-09 02:40:38,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:40:38,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 114 [2025-01-09 02:40:38,631 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:40:38,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:38,849 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 465 treesize of output 425 [2025-01-09 02:40:38,855 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 176 treesize of output 172 [2025-01-09 02:40:38,863 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 316 treesize of output 296 [2025-01-09 02:40:39,058 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 426 treesize of output 386 [2025-01-09 02:40:39,064 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 108 treesize of output 104 [2025-01-09 02:40:39,133 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:40:39,135 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 76 treesize of output 56 [2025-01-09 02:40:39,179 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 418 treesize of output 378 [2025-01-09 02:40:39,259 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:40:39,260 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 80 treesize of output 60 [2025-01-09 02:40:39,264 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 30 treesize of output 26 [2025-01-09 02:40:39,417 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:40:39,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114371278] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:40:39,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:40:39,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 18 [2025-01-09 02:40:39,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799816381] [2025-01-09 02:40:39,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:39,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 02:40:39,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:39,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 02:40:39,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2025-01-09 02:40:39,419 INFO L87 Difference]: Start difference. First operand 138 states and 178 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:40:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:39,894 INFO L93 Difference]: Finished difference Result 174 states and 229 transitions. [2025-01-09 02:40:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:40:39,894 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2025-01-09 02:40:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:39,895 INFO L225 Difference]: With dead ends: 174 [2025-01-09 02:40:39,895 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 02:40:39,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=315, Unknown=1, NotChecked=36, Total=420 [2025-01-09 02:40:39,896 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 41 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:39,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 295 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 158 Invalid, 0 Unknown, 115 Unchecked, 0.3s Time] [2025-01-09 02:40:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 02:40:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2025-01-09 02:40:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 113 states have (on average 1.2743362831858407) internal successors, (144), 114 states have internal predecessors, (144), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 02:40:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2025-01-09 02:40:39,910 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 33 [2025-01-09 02:40:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:39,910 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2025-01-09 02:40:39,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:40:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2025-01-09 02:40:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:40:39,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:39,911 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:39,920 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:40:40,116 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,SelfDestructingSolverStorable12 [2025-01-09 02:40:40,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:40,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1194019666, now seen corresponding path program 1 times [2025-01-09 02:40:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:40,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044253105] [2025-01-09 02:40:40,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:40,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:40:40,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:40:40,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:40,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:41,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:41,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044253105] [2025-01-09 02:40:41,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044253105] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:41,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245650493] [2025-01-09 02:40:41,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:41,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:40:41,693 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:40:41,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:40:41,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:40:41,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:41,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:41,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-01-09 02:40:41,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:41,950 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 10 treesize of output 8 [2025-01-09 02:40:42,071 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 40 treesize of output 16 [2025-01-09 02:40:42,095 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 48 treesize of output 41 [2025-01-09 02:40:42,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:42,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 9 [2025-01-09 02:40:42,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 15 [2025-01-09 02:40:42,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:40:42,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:40:42,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:42,215 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 13 [2025-01-09 02:40:42,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:42,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:42,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2025-01-09 02:40:42,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:42,270 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 13 [2025-01-09 02:40:42,338 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 30 treesize of output 18 [2025-01-09 02:40:42,341 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 7 treesize of output 3 [2025-01-09 02:40:42,345 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:40:42,431 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 38 treesize of output 29 [2025-01-09 02:40:42,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:42,436 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 20 treesize of output 15 [2025-01-09 02:40:42,447 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:40:42,447 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 28 treesize of output 28 [2025-01-09 02:40:42,454 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:40:42,477 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 19 treesize of output 11 [2025-01-09 02:40:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:42,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:42,680 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1497 Int) (v_ArrVal_1496 (Array Int Int)) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (|v_append_to_queue_~#p.base_52| Int) (v_append_to_queue_~node~0.base_33 Int)) (or (not (= (select (store |c_#valid| |v_append_to_queue_~#p.base_52| v_ArrVal_1497) v_append_to_queue_~node~0.base_33) 0)) (= (mod (select (select (store |c_#memory_int#5| v_append_to_queue_~node~0.base_33 v_ArrVal_1496) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_1495) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1) (< |v_append_to_queue_~#p.base_52| (+ |c_#StackHeapBarrier| 1)))) is different from false [2025-01-09 02:40:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245650493] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:42,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:40:42,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2025-01-09 02:40:42,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204421381] [2025-01-09 02:40:42,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:42,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 02:40:42,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:42,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 02:40:42,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=433, Unknown=1, NotChecked=42, Total=552 [2025-01-09 02:40:42,683 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:40:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:45,061 INFO L93 Difference]: Finished difference Result 204 states and 264 transitions. [2025-01-09 02:40:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 02:40:45,061 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-01-09 02:40:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:45,062 INFO L225 Difference]: With dead ends: 204 [2025-01-09 02:40:45,062 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 02:40:45,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=199, Invalid=1135, Unknown=2, NotChecked=70, Total=1406 [2025-01-09 02:40:45,064 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 69 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:45,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 359 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 02:40:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 02:40:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 149. [2025-01-09 02:40:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.282442748091603) internal successors, (168), 132 states have internal predecessors, (168), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 02:40:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 194 transitions. [2025-01-09 02:40:45,078 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 194 transitions. Word has length 34 [2025-01-09 02:40:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:45,079 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 194 transitions. [2025-01-09 02:40:45,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:40:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2025-01-09 02:40:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:40:45,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:45,079 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:45,086 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:40:45,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 02:40:45,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:45,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1452923411, now seen corresponding path program 1 times [2025-01-09 02:40:45,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:45,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812933756] [2025-01-09 02:40:45,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:45,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:45,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:40:45,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:40:45,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:45,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:46,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:46,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812933756] [2025-01-09 02:40:46,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812933756] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:46,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112840860] [2025-01-09 02:40:46,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:46,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:46,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:46,754 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:40:46,755 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:40:46,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:40:46,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:40:46,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:46,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:46,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-01-09 02:40:47,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:47,009 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 10 treesize of output 8 [2025-01-09 02:40:47,067 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 17 treesize of output 9 [2025-01-09 02:40:47,106 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:40:47,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 15 [2025-01-09 02:40:47,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:47,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:47,124 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 25 treesize of output 13 [2025-01-09 02:40:47,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:40:47,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:40:47,218 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 13 [2025-01-09 02:40:47,325 INFO L349 Elim1Store]: treesize reduction 92, result has 25.2 percent of original size [2025-01-09 02:40:47,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 44 [2025-01-09 02:40:47,454 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 40 treesize of output 24 [2025-01-09 02:40:47,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:40:47,460 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 9 treesize of output 5 [2025-01-09 02:40:47,562 INFO L349 Elim1Store]: treesize reduction 4, result has 81.0 percent of original size [2025-01-09 02:40:47,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2025-01-09 02:40:47,572 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 47 treesize of output 36 [2025-01-09 02:40:47,576 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:40:47,583 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 22 treesize of output 17 [2025-01-09 02:40:47,654 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 21 treesize of output 13 [2025-01-09 02:40:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:47,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:47,817 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1815 Int) (v_ArrVal_1812 (Array Int Int)) (v_append_to_queue_~node~0.base_42 Int) (|v_append_to_queue_~#p.base_63| Int) (v_ArrVal_1814 (Array Int Int))) (or (< (mod (select (select (store |c_#memory_int#5| v_append_to_queue_~node~0.base_42 v_ArrVal_1813) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_1814) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500) (< |v_append_to_queue_~#p.base_63| (+ |c_#StackHeapBarrier| 1)) (not (= (select (store |c_#valid| |v_append_to_queue_~#p.base_63| v_ArrVal_1815) v_append_to_queue_~node~0.base_42) 0)))) is different from false [2025-01-09 02:40:47,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112840860] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:47,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:40:47,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2025-01-09 02:40:47,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791041525] [2025-01-09 02:40:47,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 02:40:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:47,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 02:40:47,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=610, Unknown=1, NotChecked=50, Total=756 [2025-01-09 02:40:47,820 INFO L87 Difference]: Start difference. First operand 149 states and 194 transitions. Second operand has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:40:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:49,018 INFO L93 Difference]: Finished difference Result 187 states and 249 transitions. [2025-01-09 02:40:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 02:40:49,018 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2025-01-09 02:40:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:49,019 INFO L225 Difference]: With dead ends: 187 [2025-01-09 02:40:49,020 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 02:40:49,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=1747, Unknown=1, NotChecked=88, Total=2162 [2025-01-09 02:40:49,021 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 85 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:49,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 444 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:40:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 02:40:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 162. [2025-01-09 02:40:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 144 states have internal predecessors, (186), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 02:40:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 214 transitions. [2025-01-09 02:40:49,037 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 214 transitions. Word has length 35 [2025-01-09 02:40:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:49,037 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 214 transitions. [2025-01-09 02:40:49,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:40:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 214 transitions. [2025-01-09 02:40:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:40:49,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:49,038 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:49,046 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:40:49,238 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,SelfDestructingSolverStorable14 [2025-01-09 02:40:49,238 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:49,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:49,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1087843373, now seen corresponding path program 2 times [2025-01-09 02:40:49,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:49,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173689677] [2025-01-09 02:40:49,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:40:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:49,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-09 02:40:49,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:40:49,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:40:49,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 02:40:49,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:49,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173689677] [2025-01-09 02:40:49,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173689677] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:49,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005447529] [2025-01-09 02:40:49,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:40:49,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:49,682 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:40:49,684 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:40:49,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-09 02:40:49,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:40:49,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:40:49,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:49,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 02:40:49,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:49,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 10 treesize of output 8 [2025-01-09 02:40:50,088 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) is different from false [2025-01-09 02:40:50,090 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) is different from true [2025-01-09 02:40:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 1 not checked. [2025-01-09 02:40:50,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:50,266 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2105 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2105) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2106 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2106) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2025-01-09 02:40:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005447529] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:50,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:40:50,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2025-01-09 02:40:50,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205248217] [2025-01-09 02:40:50,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:50,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 02:40:50,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:50,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 02:40:50,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=30, Unknown=3, NotChecked=22, Total=72 [2025-01-09 02:40:50,269 INFO L87 Difference]: Start difference. First operand 162 states and 214 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:40:50,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or .cse0 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2025-01-09 02:40:50,379 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or .cse0 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from true [2025-01-09 02:40:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:50,438 INFO L93 Difference]: Finished difference Result 200 states and 264 transitions. [2025-01-09 02:40:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:40:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-01-09 02:40:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:50,440 INFO L225 Difference]: With dead ends: 200 [2025-01-09 02:40:50,440 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 02:40:50,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=30, Unknown=5, NotChecked=36, Total=90 [2025-01-09 02:40:50,440 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:50,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 222 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2025-01-09 02:40:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 02:40:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2025-01-09 02:40:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 155 states have internal predecessors, (201), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 02:40:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2025-01-09 02:40:50,460 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 35 [2025-01-09 02:40:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:50,461 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2025-01-09 02:40:50,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:40:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2025-01-09 02:40:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 02:40:50,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:50,461 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:50,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 02:40:50,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:50,662 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:50,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:50,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1041433614, now seen corresponding path program 2 times [2025-01-09 02:40:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:50,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233041100] [2025-01-09 02:40:50,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:40:50,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:50,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 02:40:50,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 02:40:50,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:40:50,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:52,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:40:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233041100] [2025-01-09 02:40:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233041100] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592353196] [2025-01-09 02:40:52,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:40:52,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:40:52,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:40:52,644 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:40:52,645 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:40:52,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 02:40:52,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 02:40:52,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:40:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:40:52,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-09 02:40:52,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:40:52,950 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 59 treesize of output 46 [2025-01-09 02:40:52,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 77 [2025-01-09 02:40:52,958 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 46 treesize of output 36 [2025-01-09 02:40:52,984 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:40:52,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2025-01-09 02:40:53,049 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 40 treesize of output 16 [2025-01-09 02:40:53,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:40:53,071 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:40:53,076 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 48 treesize of output 41 [2025-01-09 02:40:53,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 15 [2025-01-09 02:40:53,182 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 34 treesize of output 15 [2025-01-09 02:40:53,195 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 30 treesize of output 31 [2025-01-09 02:40:53,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:40:53,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:40:53,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-01-09 02:40:53,290 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2025-01-09 02:40:53,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2025-01-09 02:40:53,354 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 50 treesize of output 30 [2025-01-09 02:40:53,710 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:40:53,712 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 7 treesize of output 3 [2025-01-09 02:40:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:40:53,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:40:54,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2458 (Array Int Int)) (v_ArrVal_2457 Int)) (or (not (= (mod (select v_ArrVal_2458 4) 4294967296) 1)) (= (mod (select (select (store |c_#memory_int#5| v_ArrVal_2457 v_ArrVal_2458) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1))) is different from false [2025-01-09 02:40:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592353196] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:40:54,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:40:54,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2025-01-09 02:40:54,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657959367] [2025-01-09 02:40:54,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:40:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 02:40:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:40:54,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 02:40:54,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1091, Unknown=1, NotChecked=66, Total=1260 [2025-01-09 02:40:54,120 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand has 30 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:40:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:40:58,596 INFO L93 Difference]: Finished difference Result 295 states and 387 transitions. [2025-01-09 02:40:58,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 02:40:58,597 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2025-01-09 02:40:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:40:58,598 INFO L225 Difference]: With dead ends: 295 [2025-01-09 02:40:58,598 INFO L226 Difference]: Without dead ends: 274 [2025-01-09 02:40:58,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=383, Invalid=3526, Unknown=1, NotChecked=122, Total=4032 [2025-01-09 02:40:58,600 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 110 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:40:58,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 742 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 02:40:58,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-09 02:40:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2025-01-09 02:40:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 197 states have (on average 1.299492385786802) internal successors, (256), 198 states have internal predecessors, (256), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 02:40:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 298 transitions. [2025-01-09 02:40:58,620 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 298 transitions. Word has length 42 [2025-01-09 02:40:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:40:58,620 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 298 transitions. [2025-01-09 02:40:58,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:40:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 298 transitions. [2025-01-09 02:40:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 02:40:58,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:40:58,621 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:40:58,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 02:40:58,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 02:40:58,822 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:40:58,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:40:58,823 INFO L85 PathProgramCache]: Analyzing trace with hash -806322211, now seen corresponding path program 1 times [2025-01-09 02:40:58,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:40:58,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33402267] [2025-01-09 02:40:58,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:40:58,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:40:58,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 02:40:58,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 02:40:58,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:40:58,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:00,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:41:00,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33402267] [2025-01-09 02:41:00,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33402267] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:41:00,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725644688] [2025-01-09 02:41:00,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:00,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:41:00,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:41:00,889 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:41:00,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 02:41:01,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 02:41:01,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 02:41:01,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:01,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:01,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-01-09 02:41:01,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:41:01,230 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 10 treesize of output 8 [2025-01-09 02:41:01,284 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 30 treesize of output 31 [2025-01-09 02:41:01,290 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 30 treesize of output 31 [2025-01-09 02:41:01,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:41:01,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:41:01,308 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:41:01,308 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 1 case distinctions, treesize of input 15 treesize of output 17 [2025-01-09 02:41:01,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:41:01,373 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 23 treesize of output 3 [2025-01-09 02:41:01,437 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:41:01,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 29 [2025-01-09 02:41:01,534 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:41:01,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 29 [2025-01-09 02:41:01,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:01,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:41:01,558 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2025-01-09 02:41:01,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 1 [2025-01-09 02:41:01,614 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 40 treesize of output 24 [2025-01-09 02:41:01,617 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 9 treesize of output 7 [2025-01-09 02:41:01,620 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 7 treesize of output 3 [2025-01-09 02:41:01,623 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 7 treesize of output 3 [2025-01-09 02:41:01,689 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 48 treesize of output 37 [2025-01-09 02:41:01,692 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:41:01,705 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:41:01,706 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 27 treesize of output 27 [2025-01-09 02:41:01,712 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 20 treesize of output 15 [2025-01-09 02:41:01,717 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 20 treesize of output 15 [2025-01-09 02:41:01,777 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 30 treesize of output 18 [2025-01-09 02:41:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:01,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:41:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725644688] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:41:02,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:41:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 20 [2025-01-09 02:41:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435354506] [2025-01-09 02:41:02,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:41:02,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 02:41:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:41:02,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 02:41:02,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-01-09 02:41:02,163 INFO L87 Difference]: Start difference. First operand 224 states and 298 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 18 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:41:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:41:03,271 INFO L93 Difference]: Finished difference Result 465 states and 629 transitions. [2025-01-09 02:41:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 02:41:03,271 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 18 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2025-01-09 02:41:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:41:03,273 INFO L225 Difference]: With dead ends: 465 [2025-01-09 02:41:03,273 INFO L226 Difference]: Without dead ends: 433 [2025-01-09 02:41:03,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-01-09 02:41:03,274 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 96 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 02:41:03,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 493 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 02:41:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-01-09 02:41:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 343. [2025-01-09 02:41:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 303 states have (on average 1.3003300330033003) internal successors, (394), 304 states have internal predecessors, (394), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 02:41:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 460 transitions. [2025-01-09 02:41:03,314 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 460 transitions. Word has length 43 [2025-01-09 02:41:03,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:41:03,315 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 460 transitions. [2025-01-09 02:41:03,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 18 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:41:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 460 transitions. [2025-01-09 02:41:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 02:41:03,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:41:03,316 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:41:03,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 02:41:03,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 02:41:03,517 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:41:03,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:41:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1082472883, now seen corresponding path program 1 times [2025-01-09 02:41:03,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:41:03,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687280562] [2025-01-09 02:41:03,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:03,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:41:03,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 02:41:03,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 02:41:03,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:03,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:41:05,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:41:05,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687280562] [2025-01-09 02:41:05,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687280562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:41:05,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360453377] [2025-01-09 02:41:05,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:41:05,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:41:05,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:41:05,195 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:41:05,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 02:41:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 02:41:05,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 02:41:05,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:41:05,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:41:05,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-01-09 02:41:05,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:41:05,535 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 51 treesize of output 38 [2025-01-09 02:41:05,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 69 [2025-01-09 02:41:05,563 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:41:05,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2025-01-09 02:41:05,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:41:05,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 15 [2025-01-09 02:41:05,835 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:41:06,495 INFO L349 Elim1Store]: treesize reduction 128, result has 59.1 percent of original size [2025-01-09 02:41:06,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 174 treesize of output 297 [2025-01-09 02:41:06,601 INFO L349 Elim1Store]: treesize reduction 48, result has 62.8 percent of original size [2025-01-09 02:41:06,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 32 case distinctions, treesize of input 120 treesize of output 156 [2025-01-09 02:41:17,374 WARN L286 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 1203 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-09 02:41:17,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:41:17,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 384 treesize of output 2542