./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:05:25,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:05:25,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:05:25,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:05:25,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:05:25,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:05:25,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:05:25,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:05:25,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:05:25,110 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:05:25,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:05:25,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:05:25,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:05:25,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:05:25,111 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:05:25,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:05:25,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:05:25,111 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:05:25,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:05:25,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:05:25,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:05:25,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:25,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:05:25,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:05:25,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:05:25,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:05:25,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:05:25,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:05:25,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:05:25,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:05:25,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:05:25,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:05:25,114 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2025-02-07 20:05:25,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:05:25,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:05:25,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:05:25,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:05:25,336 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:05:25,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-02-07 20:05:26,456 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba2f27d98/a662d17179cd49fcbbb854cf63454c58/FLAGf00b8404a [2025-02-07 20:05:26,801 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:05:26,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-02-07 20:05:26,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba2f27d98/a662d17179cd49fcbbb854cf63454c58/FLAGf00b8404a [2025-02-07 20:05:27,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba2f27d98/a662d17179cd49fcbbb854cf63454c58 [2025-02-07 20:05:27,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:05:27,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:05:27,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:27,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:05:27,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:05:27,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da1ccc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27, skipping insertion in model container [2025-02-07 20:05:27,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:05:27,338 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-manipulation/bubble_sort_linux-1.i[33822,33835] [2025-02-07 20:05:27,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:27,372 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:05:27,402 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-manipulation/bubble_sort_linux-1.i[33822,33835] [2025-02-07 20:05:27,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:27,445 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:05:27,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27 WrapperNode [2025-02-07 20:05:27,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:27,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:27,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:05:27,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:05:27,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,486 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 114 [2025-02-07 20:05:27,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:27,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:05:27,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:05:27,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:05:27,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,525 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2025-02-07 20:05:27,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:05:27,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:05:27,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:05:27,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:05:27,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (1/1) ... [2025-02-07 20:05:27,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:27,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:27,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:05:27,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:05:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:05:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:05:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2025-02-07 20:05:27,604 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2025-02-07 20:05:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:05:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 20:05:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-02-07 20:05:27,605 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-07 20:05:27,605 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-02-07 20:05:27,605 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:05:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:05:27,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:05:27,692 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:05:27,694 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:05:27,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc #t~mem54; [2025-02-07 20:05:27,986 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L944-1: assume 0 != gl_sort_#t~ret59#1 % 256;havoc gl_sort_#t~ret59#1; [2025-02-07 20:05:27,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L944-1: assume !(0 != gl_sort_#t~ret59#1 % 256);havoc gl_sort_#t~ret59#1; [2025-02-07 20:05:27,987 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L944-2: gl_sort_#t~ret59#1 := gl_sort_pass_#res#1;havoc gl_sort_pass_#t~mem55#1.base, gl_sort_pass_#t~mem55#1.offset, gl_sort_pass_#t~mem56#1.base, gl_sort_pass_#t~mem56#1.offset, gl_sort_pass_#t~ret57#1, gl_sort_pass_#t~ret58#1, gl_sort_pass_~val0~0#1, gl_sort_pass_~val1~0#1, gl_sort_pass_~any_change~0#1, gl_sort_pass_~pos0~0#1.base, gl_sort_pass_~pos0~0#1.offset, gl_sort_pass_~pos1~0#1.base, gl_sort_pass_~pos1~0#1.offset;assume { :end_inline_gl_sort_pass } true; [2025-02-07 20:05:28,010 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-02-07 20:05:28,011 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:05:28,018 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:05:28,018 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:05:28,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:28 BoogieIcfgContainer [2025-02-07 20:05:28,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:05:28,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:05:28,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:05:28,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:05:28,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:05:27" (1/3) ... [2025-02-07 20:05:28,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324846f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:28, skipping insertion in model container [2025-02-07 20:05:28,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:27" (2/3) ... [2025-02-07 20:05:28,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324846f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:28, skipping insertion in model container [2025-02-07 20:05:28,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:28" (3/3) ... [2025-02-07 20:05:28,026 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2025-02-07 20:05:28,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:05:28,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-1.i that has 5 procedures, 118 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-02-07 20:05:28,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:05:28,092 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;@94b19e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:05:28,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:05:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 87 states have (on average 1.735632183908046) internal successors, (151), 108 states have internal predecessors, (151), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-07 20:05:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:05:28,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:28,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:28,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:28,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash 256329394, now seen corresponding path program 1 times [2025-02-07 20:05:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:28,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366791876] [2025-02-07 20:05:28,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:28,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:05:28,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:05:28,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:28,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:28,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:28,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366791876] [2025-02-07 20:05:28,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366791876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:28,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:28,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:05:28,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074441286] [2025-02-07 20:05:28,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:28,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:05:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:28,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:05:28,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:05:28,266 INFO L87 Difference]: Start difference. First operand has 118 states, 87 states have (on average 1.735632183908046) internal successors, (151), 108 states have internal predecessors, (151), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:28,290 INFO L93 Difference]: Finished difference Result 223 states and 379 transitions. [2025-02-07 20:05:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:05:28,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 20:05:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:28,299 INFO L225 Difference]: With dead ends: 223 [2025-02-07 20:05:28,303 INFO L226 Difference]: Without dead ends: 86 [2025-02-07 20:05:28,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:05:28,312 INFO L435 NwaCegarLoop]: 124 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, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:28,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-07 20:05:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-07 20:05:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 81 states have internal predecessors, (83), 17 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2025-02-07 20:05:28,364 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 9 [2025-02-07 20:05:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:28,369 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2025-02-07 20:05:28,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2025-02-07 20:05:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 20:05:28,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:28,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:28,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:05:28,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:28,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:28,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1976831945, now seen corresponding path program 1 times [2025-02-07 20:05:28,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:28,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594755608] [2025-02-07 20:05:28,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:28,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:28,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:05:28,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:05:28,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:28,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594755608] [2025-02-07 20:05:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594755608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:28,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:05:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087209763] [2025-02-07 20:05:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:28,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:05:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:28,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:05:28,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:05:28,690 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:28,803 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2025-02-07 20:05:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:05:28,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-02-07 20:05:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:28,804 INFO L225 Difference]: With dead ends: 88 [2025-02-07 20:05:28,804 INFO L226 Difference]: Without dead ends: 85 [2025-02-07 20:05:28,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:05:28,805 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 154 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:28,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 180 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-07 20:05:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-07 20:05:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 80 states have internal predecessors, (82), 16 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2025-02-07 20:05:28,814 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 19 [2025-02-07 20:05:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:28,814 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2025-02-07 20:05:28,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2025-02-07 20:05:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:05:28,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:28,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:28,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:05:28,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:28,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash 738361020, now seen corresponding path program 1 times [2025-02-07 20:05:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:28,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555783399] [2025-02-07 20:05:28,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:28,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:05:28,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:05:28,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:28,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:29,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:29,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555783399] [2025-02-07 20:05:29,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555783399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:29,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:29,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 20:05:29,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570450093] [2025-02-07 20:05:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:29,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:05:29,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:29,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:05:29,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:05:29,267 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:29,698 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2025-02-07 20:05:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:05:29,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-07 20:05:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:29,701 INFO L225 Difference]: With dead ends: 92 [2025-02-07 20:05:29,701 INFO L226 Difference]: Without dead ends: 89 [2025-02-07 20:05:29,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-02-07 20:05:29,701 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 227 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:29,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 344 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:05:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-07 20:05:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2025-02-07 20:05:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.208955223880597) internal successors, (81), 79 states have internal predecessors, (81), 15 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2025-02-07 20:05:29,719 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 22 [2025-02-07 20:05:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:29,719 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-02-07 20:05:29,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2025-02-07 20:05:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 20:05:29,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:29,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:29,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:05:29,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:29,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1928062836, now seen corresponding path program 1 times [2025-02-07 20:05:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:29,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486115711] [2025-02-07 20:05:29,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:29,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:05:29,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:05:29,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:29,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486115711] [2025-02-07 20:05:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486115711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:30,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:30,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 20:05:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606952260] [2025-02-07 20:05:30,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:30,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:05:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:30,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:05:30,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:05:30,608 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:31,413 INFO L93 Difference]: Finished difference Result 170 states and 196 transitions. [2025-02-07 20:05:31,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:05:31,413 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-07 20:05:31,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:31,414 INFO L225 Difference]: With dead ends: 170 [2025-02-07 20:05:31,416 INFO L226 Difference]: Without dead ends: 167 [2025-02-07 20:05:31,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-02-07 20:05:31,417 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 300 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:31,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 74 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 20:05:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-07 20:05:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 103. [2025-02-07 20:05:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.1785714285714286) internal successors, (99), 96 states have internal predecessors, (99), 17 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:05:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2025-02-07 20:05:31,441 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 25 [2025-02-07 20:05:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:31,442 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2025-02-07 20:05:31,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2025-02-07 20:05:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:05:31,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:31,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:31,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:05:31,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:31,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1338397939, now seen corresponding path program 1 times [2025-02-07 20:05:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:31,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219405624] [2025-02-07 20:05:31,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:31,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:05:31,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:05:31,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:31,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219405624] [2025-02-07 20:05:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219405624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 20:05:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958352022] [2025-02-07 20:05:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:05:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:32,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:05:32,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:05:32,000 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:32,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:32,721 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2025-02-07 20:05:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:05:32,721 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-07 20:05:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:32,722 INFO L225 Difference]: With dead ends: 169 [2025-02-07 20:05:32,723 INFO L226 Difference]: Without dead ends: 166 [2025-02-07 20:05:32,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-02-07 20:05:32,724 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 343 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:32,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 80 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:05:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-07 20:05:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 107. [2025-02-07 20:05:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 100 states have internal predecessors, (103), 17 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:05:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2025-02-07 20:05:32,744 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 29 [2025-02-07 20:05:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:32,744 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2025-02-07 20:05:32,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2025-02-07 20:05:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 20:05:32,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:32,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:32,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:05:32,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:32,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1963410678, now seen corresponding path program 1 times [2025-02-07 20:05:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:32,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502766886] [2025-02-07 20:05:32,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:32,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:32,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 20:05:32,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 20:05:32,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:32,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:33,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:33,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502766886] [2025-02-07 20:05:33,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502766886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:33,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:33,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 20:05:33,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50077074] [2025-02-07 20:05:33,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:33,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 20:05:33,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:33,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 20:05:33,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:05:33,342 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:34,033 INFO L93 Difference]: Finished difference Result 168 states and 192 transitions. [2025-02-07 20:05:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:05:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-02-07 20:05:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:34,035 INFO L225 Difference]: With dead ends: 168 [2025-02-07 20:05:34,035 INFO L226 Difference]: Without dead ends: 165 [2025-02-07 20:05:34,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-02-07 20:05:34,036 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 331 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:34,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 80 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:05:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-07 20:05:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 110. [2025-02-07 20:05:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.164835164835165) internal successors, (106), 103 states have internal predecessors, (106), 17 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:05:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2025-02-07 20:05:34,063 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 32 [2025-02-07 20:05:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:34,063 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2025-02-07 20:05:34,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2025-02-07 20:05:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-07 20:05:34,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:34,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:34,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:05:34,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:34,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:34,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1976495047, now seen corresponding path program 1 times [2025-02-07 20:05:34,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:34,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437182995] [2025-02-07 20:05:34,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:34,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 20:05:34,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 20:05:34,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:34,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:34,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:34,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437182995] [2025-02-07 20:05:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437182995] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:34,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027199493] [2025-02-07 20:05:34,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:34,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:34,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:34,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:05:34,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:05:34,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 20:05:34,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 20:05:34,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:34,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:34,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-07 20:05:34,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:35,049 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:05:35,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-07 20:05:35,100 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-02-07 20:05:35,106 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-02-07 20:05:35,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2025-02-07 20:05:35,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2025-02-07 20:05:35,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:35,321 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 14 [2025-02-07 20:05:35,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2025-02-07 20:05:35,428 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2025-02-07 20:05:35,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 29 [2025-02-07 20:05:35,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2025-02-07 20:05:35,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-02-07 20:05:35,523 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 43 treesize of output 39 [2025-02-07 20:05:35,532 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 56 treesize of output 52 [2025-02-07 20:05:35,539 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 49 treesize of output 45 [2025-02-07 20:05:35,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-02-07 20:05:35,560 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 43 treesize of output 39 [2025-02-07 20:05:35,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-07 20:05:35,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-07 20:05:35,720 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2025-02-07 20:05:35,855 INFO L349 Elim1Store]: treesize reduction 74, result has 6.3 percent of original size [2025-02-07 20:05:35,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 72 [2025-02-07 20:05:35,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-07 20:05:35,963 INFO L349 Elim1Store]: treesize reduction 92, result has 22.0 percent of original size [2025-02-07 20:05:35,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1431 treesize of output 1284 [2025-02-07 20:05:36,002 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 310 treesize of output 302 [2025-02-07 20:05:36,023 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-07 20:05:36,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 424 treesize of output 398 [2025-02-07 20:05:36,054 INFO L349 Elim1Store]: treesize reduction 26, result has 48.0 percent of original size [2025-02-07 20:05:36,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 382 treesize of output 364 [2025-02-07 20:05:36,121 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-07 20:05:36,121 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 33 treesize of output 25 [2025-02-07 20:05:36,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 16 [2025-02-07 20:05:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:36,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:36,404 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 53 treesize of output 49 [2025-02-07 20:05:36,410 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_381 (Array Int Int)) (v_arrayElimCell_37 Int) (v_ArrVal_374 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_381) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) (+ 4 v_arrayElimCell_37) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_382) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_374) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)) |c_~#gl_list~0.base|))) is different from false [2025-02-07 20:05:36,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027199493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:36,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:05:36,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2025-02-07 20:05:36,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628336990] [2025-02-07 20:05:36,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:36,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 20:05:36,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:36,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 20:05:36,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=864, Unknown=10, NotChecked=60, Total=1056 [2025-02-07 20:05:36,413 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 30 states, 29 states have (on average 2.0) internal successors, (58), 19 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:05:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:39,815 INFO L93 Difference]: Finished difference Result 412 states and 475 transitions. [2025-02-07 20:05:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-07 20:05:39,816 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 19 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2025-02-07 20:05:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:39,817 INFO L225 Difference]: With dead ends: 412 [2025-02-07 20:05:39,817 INFO L226 Difference]: Without dead ends: 409 [2025-02-07 20:05:39,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=512, Invalid=3142, Unknown=10, NotChecked=118, Total=3782 [2025-02-07 20:05:39,822 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1608 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2426 mSolverCounterSat, 261 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 2426 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:39,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 171 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 2426 Invalid, 2 Unknown, 0 Unchecked, 2.2s Time] [2025-02-07 20:05:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-02-07 20:05:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 151. [2025-02-07 20:05:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 126 states have (on average 1.1428571428571428) internal successors, (144), 138 states have internal predecessors, (144), 21 states have call successors, (21), 7 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:05:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 170 transitions. [2025-02-07 20:05:39,858 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 170 transitions. Word has length 36 [2025-02-07 20:05:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:39,860 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 170 transitions. [2025-02-07 20:05:39,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 19 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:05:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 170 transitions. [2025-02-07 20:05:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 20:05:39,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:39,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:39,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 20:05:40,062 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-02-07 20:05:40,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:40,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1265110160, now seen corresponding path program 1 times [2025-02-07 20:05:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743066138] [2025-02-07 20:05:40,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:40,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:40,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 20:05:40,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:05:40,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:40,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:40,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743066138] [2025-02-07 20:05:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743066138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:40,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:40,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-07 20:05:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587507871] [2025-02-07 20:05:40,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:40,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 20:05:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:40,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 20:05:40,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:05:40,868 INFO L87 Difference]: Start difference. First operand 151 states and 170 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:41,868 INFO L93 Difference]: Finished difference Result 205 states and 232 transitions. [2025-02-07 20:05:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 20:05:41,868 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-02-07 20:05:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:41,869 INFO L225 Difference]: With dead ends: 205 [2025-02-07 20:05:41,869 INFO L226 Difference]: Without dead ends: 202 [2025-02-07 20:05:41,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-02-07 20:05:41,870 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 330 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:41,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 98 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 20:05:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-07 20:05:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 154. [2025-02-07 20:05:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 129 states have (on average 1.1395348837209303) internal successors, (147), 141 states have internal predecessors, (147), 21 states have call successors, (21), 7 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:05:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2025-02-07 20:05:41,913 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 35 [2025-02-07 20:05:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:41,914 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2025-02-07 20:05:41,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2025-02-07 20:05:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 20:05:41,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:41,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:41,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 20:05:41,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:41,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:41,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1284663496, now seen corresponding path program 1 times [2025-02-07 20:05:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:41,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947391461] [2025-02-07 20:05:41,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:41,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 20:05:41,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 20:05:41,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:41,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:05:42,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:42,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947391461] [2025-02-07 20:05:42,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947391461] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:42,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108714803] [2025-02-07 20:05:42,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:42,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:42,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:42,669 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:05:42,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:05:42,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 20:05:42,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 20:05:42,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:42,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:42,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-07 20:05:42,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:42,815 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-07 20:05:42,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-07 20:05:42,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-07 20:05:42,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-07 20:05:42,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2025-02-07 20:05:42,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2025-02-07 20:05:42,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2025-02-07 20:05:42,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2025-02-07 20:05:42,984 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 17 treesize of output 18 [2025-02-07 20:05:43,047 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-02-07 20:05:43,047 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2025-02-07 20:05:43,111 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:05:43,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-07 20:05:43,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2025-02-07 20:05:43,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 133 treesize of output 117 [2025-02-07 20:05:43,312 INFO L349 Elim1Store]: treesize reduction 125, result has 16.7 percent of original size [2025-02-07 20:05:43,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 62 [2025-02-07 20:05:43,417 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2025-02-07 20:05:43,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 136 treesize of output 107 [2025-02-07 20:05:43,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:43,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 117 [2025-02-07 20:05:43,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:43,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 88 [2025-02-07 20:05:44,351 INFO L349 Elim1Store]: treesize reduction 26, result has 83.6 percent of original size [2025-02-07 20:05:44,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 102 treesize of output 171 [2025-02-07 20:05:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:44,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:44,639 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 104 treesize of output 92 [2025-02-07 20:05:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108714803] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:44,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:05:44,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2025-02-07 20:05:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216450147] [2025-02-07 20:05:44,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:44,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 20:05:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:44,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 20:05:44,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1012, Unknown=8, NotChecked=0, Total=1122 [2025-02-07 20:05:44,711 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 18 states have internal predecessors, (66), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:05:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:47,288 INFO L93 Difference]: Finished difference Result 274 states and 311 transitions. [2025-02-07 20:05:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-07 20:05:47,289 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 18 states have internal predecessors, (66), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2025-02-07 20:05:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:47,293 INFO L225 Difference]: With dead ends: 274 [2025-02-07 20:05:47,293 INFO L226 Difference]: Without dead ends: 271 [2025-02-07 20:05:47,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=399, Invalid=2673, Unknown=8, NotChecked=0, Total=3080 [2025-02-07 20:05:47,294 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1589 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:47,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 121 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-07 20:05:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-07 20:05:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2025-02-07 20:05:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 129 states have (on average 1.1317829457364341) internal successors, (146), 140 states have internal predecessors, (146), 20 states have call successors, (20), 7 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:05:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2025-02-07 20:05:47,325 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 40 [2025-02-07 20:05:47,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:47,325 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2025-02-07 20:05:47,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 18 states have internal predecessors, (66), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:05:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2025-02-07 20:05:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 20:05:47,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:47,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:47,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:05:47,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:47,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:47,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:47,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1741037679, now seen corresponding path program 1 times [2025-02-07 20:05:47,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:47,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832295364] [2025-02-07 20:05:47,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:47,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:47,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 20:05:47,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 20:05:47,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:47,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:47,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:47,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832295364] [2025-02-07 20:05:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832295364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:47,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:47,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 20:05:47,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803578370] [2025-02-07 20:05:47,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:47,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 20:05:47,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:47,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 20:05:47,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:05:47,876 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:48,563 INFO L93 Difference]: Finished difference Result 203 states and 228 transitions. [2025-02-07 20:05:48,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 20:05:48,564 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-02-07 20:05:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:48,565 INFO L225 Difference]: With dead ends: 203 [2025-02-07 20:05:48,565 INFO L226 Difference]: Without dead ends: 200 [2025-02-07 20:05:48,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-02-07 20:05:48,565 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 395 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:48,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 69 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:05:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-07 20:05:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 157. [2025-02-07 20:05:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 133 states have (on average 1.1278195488721805) internal successors, (150), 144 states have internal predecessors, (150), 20 states have call successors, (20), 7 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:05:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2025-02-07 20:05:48,604 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 39 [2025-02-07 20:05:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:48,604 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2025-02-07 20:05:48,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:05:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2025-02-07 20:05:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 20:05:48,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:48,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:48,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:05:48,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:48,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash 975184017, now seen corresponding path program 1 times [2025-02-07 20:05:48,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138597761] [2025-02-07 20:05:48,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:48,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 20:05:48,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 20:05:48,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:48,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:05:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138597761] [2025-02-07 20:05:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138597761] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:49,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205795578] [2025-02-07 20:05:49,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:49,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:49,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:49,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:05:49,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:05:49,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 20:05:49,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 20:05:49,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:49,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:49,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-02-07 20:05:49,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:49,801 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:05:49,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-07 20:05:49,856 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-02-07 20:05:49,863 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-02-07 20:05:50,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2025-02-07 20:05:50,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 65 [2025-02-07 20:05:50,051 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 31 treesize of output 15 [2025-02-07 20:05:50,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2025-02-07 20:05:50,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 18 [2025-02-07 20:05:50,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2025-02-07 20:05:50,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:50,081 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 32 treesize of output 15 [2025-02-07 20:05:50,083 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 17 treesize of output 18 [2025-02-07 20:05:50,140 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-07 20:05:50,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 66 [2025-02-07 20:05:50,148 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 31 treesize of output 16 [2025-02-07 20:05:50,385 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2025-02-07 20:05:50,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 29 [2025-02-07 20:05:50,466 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-07 20:05:50,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 47 [2025-02-07 20:05:50,477 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 23 treesize of output 16 [2025-02-07 20:05:57,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 53 [2025-02-07 20:05:57,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:57,069 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 33 treesize of output 28 [2025-02-07 20:05:57,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2025-02-07 20:05:57,195 INFO L349 Elim1Store]: treesize reduction 494, result has 13.3 percent of original size [2025-02-07 20:05:57,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 492 treesize of output 264 [2025-02-07 20:05:58,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:58,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:58,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:58,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 117 [2025-02-07 20:05:58,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:58,309 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 17 treesize of output 11 [2025-02-07 20:05:58,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:58,318 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 17 treesize of output 11 [2025-02-07 20:05:58,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 28 treesize of output 22 [2025-02-07 20:05:58,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 28 treesize of output 22 [2025-02-07 20:05:58,335 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 31 treesize of output 23 [2025-02-07 20:05:58,352 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 15 treesize of output 11 [2025-02-07 20:05:58,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:58,371 INFO L349 Elim1Store]: treesize reduction 57, result has 1.7 percent of original size [2025-02-07 20:05:58,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2251 treesize of output 2157 [2025-02-07 20:05:58,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:58,408 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 99 treesize of output 71 [2025-02-07 20:05:58,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:58,416 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 92 treesize of output 66 [2025-02-07 20:05:58,422 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 31 treesize of output 23 [2025-02-07 20:05:58,427 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 15 treesize of output 11 [2025-02-07 20:05:58,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 28 treesize of output 22 [2025-02-07 20:05:58,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 28 treesize of output 22 [2025-02-07 20:05:58,807 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-02-07 20:05:58,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:58,872 INFO L349 Elim1Store]: treesize reduction 94, result has 38.2 percent of original size [2025-02-07 20:05:58,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 1491 treesize of output 1395 [2025-02-07 20:05:58,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:58,891 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 280 treesize of output 252 [2025-02-07 20:05:58,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:58,899 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 234 treesize of output 228 [2025-02-07 20:05:58,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 228 treesize of output 222 [2025-02-07 20:05:58,911 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 222 treesize of output 218 [2025-02-07 20:05:58,917 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 218 treesize of output 214 [2025-02-07 20:05:58,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 214 treesize of output 208 [2025-02-07 20:05:59,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:59,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 55 [2025-02-07 20:05:59,366 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-02-07 20:05:59,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 37 [2025-02-07 20:05:59,374 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2025-02-07 20:05:59,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 41 [2025-02-07 20:05:59,382 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2025-02-07 20:05:59,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 93 [2025-02-07 20:05:59,466 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-02-07 20:05:59,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 36 [2025-02-07 20:05:59,476 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2025-02-07 20:05:59,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2025-02-07 20:05:59,486 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2025-02-07 20:05:59,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 39 [2025-02-07 20:06:01,331 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2025-02-07 20:06:01,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 31 [2025-02-07 20:06:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:01,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:06:03,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_832)) (.cse2 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_831) |c_~#gl_list~0.base|) .cse2))))))) is different from false [2025-02-07 20:06:03,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_849 Int) (v_ArrVal_848 Int) (v_ArrVal_847 Int) (|v_list_add_~new#1.offset_31| Int)) (not (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4))) (let ((.cse0 (store (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) .cse4 v_ArrVal_848)))) (store .cse6 |c_~#gl_list~0.base| (store (select (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add_~new#1.offset_31| .cse3) (+ |v_list_add_~new#1.offset_31| 4) |c_~#gl_list~0.base|)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_832)) (.cse5 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse5))) (= (select (select .cse0 .cse1) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| .cse3 (store (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4 v_ArrVal_849)))) (store .cse2 |c_~#gl_list~0.base| (store (select (store .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_846) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_847))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_831) |c_~#gl_list~0.base|) .cse5)) .cse1)))))) is different from false [2025-02-07 20:06:03,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205795578] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:03,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:06:03,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2025-02-07 20:06:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037345857] [2025-02-07 20:06:03,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:06:03,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 20:06:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:03,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 20:06:03,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1097, Unknown=3, NotChecked=134, Total=1332 [2025-02-07 20:06:03,208 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand has 30 states, 30 states have (on average 2.4) internal successors, (72), 20 states have internal predecessors, (72), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:06:36,017 WARN L286 SmtUtils]: Spent 22.38s on a formula simplification. DAG size of input: 145 DAG size of output: 137 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 20:06:44,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:50,350 INFO L93 Difference]: Finished difference Result 272 states and 306 transitions. [2025-02-07 20:06:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-07 20:06:50,350 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.4) internal successors, (72), 20 states have internal predecessors, (72), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2025-02-07 20:06:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:50,353 INFO L225 Difference]: With dead ends: 272 [2025-02-07 20:06:50,353 INFO L226 Difference]: Without dead ends: 269 [2025-02-07 20:06:50,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=319, Invalid=2651, Unknown=8, NotChecked=214, Total=3192 [2025-02-07 20:06:50,354 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 944 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 3557 mSolverCounterSat, 93 mSolverCounterUnsat, 47 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 3697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3557 IncrementalHoareTripleChecker+Invalid, 47 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:50,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 267 Invalid, 3697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3557 Invalid, 47 Unknown, 0 Unchecked, 12.8s Time] [2025-02-07 20:06:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-07 20:06:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 175. [2025-02-07 20:06:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 150 states have (on average 1.1133333333333333) internal successors, (167), 161 states have internal predecessors, (167), 21 states have call successors, (21), 8 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:06:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 193 transitions. [2025-02-07 20:06:50,402 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 193 transitions. Word has length 43 [2025-02-07 20:06:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:50,402 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 193 transitions. [2025-02-07 20:06:50,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.4) internal successors, (72), 20 states have internal predecessors, (72), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:06:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 193 transitions. [2025-02-07 20:06:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 20:06:50,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:50,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:50,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 20:06:50,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:50,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:06:50,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:50,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1144794224, now seen corresponding path program 1 times [2025-02-07 20:06:50,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:50,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906675893] [2025-02-07 20:06:50,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:50,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:50,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 20:06:50,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 20:06:50,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:50,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:51,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906675893] [2025-02-07 20:06:51,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906675893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:51,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:51,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 20:06:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82210251] [2025-02-07 20:06:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:51,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:06:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:51,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:06:51,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:06:51,135 INFO L87 Difference]: Start difference. First operand 175 states and 193 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:06:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:52,078 INFO L93 Difference]: Finished difference Result 220 states and 244 transitions. [2025-02-07 20:06:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 20:06:52,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-02-07 20:06:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:52,080 INFO L225 Difference]: With dead ends: 220 [2025-02-07 20:06:52,080 INFO L226 Difference]: Without dead ends: 217 [2025-02-07 20:06:52,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-02-07 20:06:52,081 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 351 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:52,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 90 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 20:06:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-07 20:06:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 178. [2025-02-07 20:06:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 153 states have (on average 1.1111111111111112) internal successors, (170), 164 states have internal predecessors, (170), 21 states have call successors, (21), 8 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:06:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2025-02-07 20:06:52,129 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 42 [2025-02-07 20:06:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:52,130 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2025-02-07 20:06:52,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:06:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2025-02-07 20:06:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-07 20:06:52,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:52,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:52,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 20:06:52,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:06:52,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash 475246069, now seen corresponding path program 1 times [2025-02-07 20:06:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355283612] [2025-02-07 20:06:52,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:52,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 20:06:52,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 20:06:52,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:52,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:06:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355283612] [2025-02-07 20:06:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355283612] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656678525] [2025-02-07 20:06:53,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:53,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:53,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:06:53,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:06:53,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:06:53,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 20:06:53,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 20:06:53,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:53,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:53,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-02-07 20:06:53,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:06:53,430 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:06:53,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-07 20:06:53,455 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-02-07 20:06:53,458 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-02-07 20:06:53,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2025-02-07 20:06:53,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:53,676 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 32 treesize of output 15 [2025-02-07 20:06:53,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 18 [2025-02-07 20:06:53,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2025-02-07 20:06:53,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2025-02-07 20:06:53,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 26 [2025-02-07 20:06:53,698 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 17 treesize of output 18 [2025-02-07 20:06:53,784 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-07 20:06:53,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 52 [2025-02-07 20:06:53,791 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 31 treesize of output 16 [2025-02-07 20:06:53,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:53,884 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-07 20:06:53,884 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 20 treesize of output 22 [2025-02-07 20:06:53,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2025-02-07 20:06:53,961 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 23 treesize of output 16 [2025-02-07 20:06:54,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 110 [2025-02-07 20:06:54,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2025-02-07 20:06:54,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 86 [2025-02-07 20:06:54,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:54,290 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-02-07 20:06:54,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 89 [2025-02-07 20:06:54,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 129 [2025-02-07 20:06:54,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:54,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:54,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:54,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2025-02-07 20:06:54,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2025-02-07 20:06:54,429 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-07 20:06:54,430 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 61 [2025-02-07 20:06:54,437 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 13 treesize of output 11 [2025-02-07 20:06:54,756 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-07 20:06:54,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 25 [2025-02-07 20:06:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:54,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:06:54,991 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1080)) (.cse2 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (= .cse0 (select (select .cse1 .cse0) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1079) |c_~#gl_list~0.base|) .cse2) 4))))))) is different from false [2025-02-07 20:06:55,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1101 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1103 Int) (v_ArrVal_1102 Int) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1104 Int) (|v_list_add_~new#1.offset_41| Int)) (not (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4))) (let ((.cse1 (store (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse6 |c_~#gl_list~0.base| (store (select (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1099) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1103))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1080)) (.cse5 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse5))) (= .cse0 (select (select .cse1 .cse0) (+ (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| .cse3 (store (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4 v_ArrVal_1101)))) (store .cse2 |c_~#gl_list~0.base| (store (select (store .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add_~new#1.offset_41| v_ArrVal_1104) (+ |v_list_add_~new#1.offset_41| 4) |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1102))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1079) |c_~#gl_list~0.base|) .cse5) 4)))))))) is different from false [2025-02-07 20:06:55,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656678525] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:55,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:06:55,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2025-02-07 20:06:55,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17112236] [2025-02-07 20:06:55,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:06:55,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 20:06:55,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:55,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 20:06:55,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=8, NotChecked=134, Total=1332 [2025-02-07 20:06:55,105 INFO L87 Difference]: Start difference. First operand 178 states and 196 transitions. Second operand has 30 states, 30 states have (on average 2.4) internal successors, (72), 20 states have internal predecessors, (72), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-07 20:06:59,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]