./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:26:54,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:26:54,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:26:54,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:26:54,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:26:54,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:26:54,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:26:54,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:26:54,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:26:54,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:26:54,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:26:54,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:26:54,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:26:54,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:26:54,753 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:26:54,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:26:54,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:26:54,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:26:54,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:26:54,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:26:54,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:26:54,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:26:54,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:26:54,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:26:54,755 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:26:54,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:26:54,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:26:54,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:26:54,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:26:54,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:26:54,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:26:54,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:26:54,756 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/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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2025-03-08 04:26:54,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:26:54,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:26:54,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:26:54,991 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:26:54,991 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:26:54,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2025-03-08 04:26:56,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f476d74cf/5776e6363d7f40a0adc6257393a1e286/FLAG537bd72d0 [2025-03-08 04:26:56,463 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:26:56,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2025-03-08 04:26:56,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f476d74cf/5776e6363d7f40a0adc6257393a1e286/FLAG537bd72d0 [2025-03-08 04:26:56,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f476d74cf/5776e6363d7f40a0adc6257393a1e286 [2025-03-08 04:26:56,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:26:56,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:26:56,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:26:56,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:26:56,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:26:56,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:56,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccab167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56, skipping insertion in model container [2025-03-08 04:26:56,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:56,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:26:56,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2025-03-08 04:26:56,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:26:56,870 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:26:56,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2025-03-08 04:26:56,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:26:56,935 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:26:56,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56 WrapperNode [2025-03-08 04:26:56,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:26:56,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:26:56,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:26:56,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:26:56,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:56,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:56,961 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 114 [2025-03-08 04:26:56,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:26:56,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:26:56,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:26:56,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:26:56,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:56,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:56,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:56,992 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-03-08 04:26:56,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:56,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:57,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:57,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:57,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:57,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:57,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:26:57,006 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:26:57,006 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:26:57,006 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:26:57,006 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (1/1) ... [2025-03-08 04:26:57,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:26:57,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:57,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:26:57,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2025-03-08 04:26:57,046 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-03-08 04:26:57,046 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-08 04:26:57,046 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-03-08 04:26:57,046 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:26:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:26:57,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:26:57,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:26:57,160 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:26:57,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:26:57,188 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc #t~mem54; [2025-03-08 04:26:57,506 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-08 04:26:57,509 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:26:57,517 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:26:57,517 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:26:57,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:57 BoogieIcfgContainer [2025-03-08 04:26:57,518 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:26:57,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:26:57,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:26:57,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:26:57,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:26:56" (1/3) ... [2025-03-08 04:26:57,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf3c326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:57, skipping insertion in model container [2025-03-08 04:26:57,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:56" (2/3) ... [2025-03-08 04:26:57,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf3c326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:57, skipping insertion in model container [2025-03-08 04:26:57,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:57" (3/3) ... [2025-03-08 04:26:57,526 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2025-03-08 04:26:57,539 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:26:57,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-2.i that has 5 procedures, 115 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-03-08 04:26:57,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:26:57,599 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;@39175c7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:26:57,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:26:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 86 states have (on average 1.755813953488372) internal successors, (151), 105 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-03-08 04:26:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 04:26:57,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:57,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:57,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:57,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash -989002152, now seen corresponding path program 1 times [2025-03-08 04:26:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27601826] [2025-03-08 04:26:57,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:57,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:57,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 04:26:57,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 04:26:57,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:57,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:57,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:57,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27601826] [2025-03-08 04:26:57,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27601826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:57,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:26:57,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86096963] [2025-03-08 04:26:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:57,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:26:57,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:57,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:26:57,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:26:57,757 INFO L87 Difference]: Start difference. First operand has 115 states, 86 states have (on average 1.755813953488372) internal successors, (151), 105 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-03-08 04:26:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:57,783 INFO L93 Difference]: Finished difference Result 224 states and 389 transitions. [2025-03-08 04:26:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:26:57,784 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-03-08 04:26:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:57,788 INFO L225 Difference]: With dead ends: 224 [2025-03-08 04:26:57,788 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 04:26:57,791 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-03-08 04:26:57,793 INFO L435 NwaCegarLoop]: 133 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, 133 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-03-08 04:26:57,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:26:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 04:26:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 04:26:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 94 states have internal predecessors, (99), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:26:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2025-03-08 04:26:57,818 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 9 [2025-03-08 04:26:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:57,819 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2025-03-08 04:26:57,819 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-03-08 04:26:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2025-03-08 04:26:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:26:57,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:57,820 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] [2025-03-08 04:26:57,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:26:57,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:57,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1431836838, now seen corresponding path program 1 times [2025-03-08 04:26:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:57,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298128101] [2025-03-08 04:26:57,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:57,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:26:57,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:26:57,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:57,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:58,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298128101] [2025-03-08 04:26:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298128101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:58,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:58,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:26:58,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414988215] [2025-03-08 04:26:58,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:58,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:26:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:58,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:26:58,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:26:58,091 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-03-08 04:26:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:58,250 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2025-03-08 04:26:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:26:58,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20 [2025-03-08 04:26:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:58,254 INFO L225 Difference]: With dead ends: 106 [2025-03-08 04:26:58,254 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 04:26:58,254 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-03-08 04:26:58,255 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 172 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:58,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 242 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:26:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 04:26:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-08 04:26:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.240506329113924) internal successors, (98), 93 states have internal predecessors, (98), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:26:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2025-03-08 04:26:58,276 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 20 [2025-03-08 04:26:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:58,278 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2025-03-08 04:26:58,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-03-08 04:26:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2025-03-08 04:26:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 04:26:58,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:58,279 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] [2025-03-08 04:26:58,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:26:58,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:58,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:58,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1707336119, now seen corresponding path program 1 times [2025-03-08 04:26:58,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:58,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605427169] [2025-03-08 04:26:58,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:58,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:58,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:26:58,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:26:58,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:58,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:58,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:58,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605427169] [2025-03-08 04:26:58,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605427169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:58,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:58,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 04:26:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017380165] [2025-03-08 04:26:58,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:58,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:26:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:58,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:26:58,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:26:58,798 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 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-03-08 04:26:59,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:59,300 INFO L93 Difference]: Finished difference Result 193 states and 230 transitions. [2025-03-08 04:26:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:26:59,301 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 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 23 [2025-03-08 04:26:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:59,303 INFO L225 Difference]: With dead ends: 193 [2025-03-08 04:26:59,303 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 04:26:59,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-08 04:26:59,306 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 351 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:59,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 567 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 04:26:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 04:26:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2025-03-08 04:26:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 153 states have internal predecessors, (174), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 04:26:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2025-03-08 04:26:59,340 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 23 [2025-03-08 04:26:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:59,341 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2025-03-08 04:26:59,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 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-03-08 04:26:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2025-03-08 04:26:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:26:59,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:59,342 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] [2025-03-08 04:26:59,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:26:59,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:59,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2108805225, now seen corresponding path program 1 times [2025-03-08 04:26:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:59,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901388711] [2025-03-08 04:26:59,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:59,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:59,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:26:59,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:26:59,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:59,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:00,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901388711] [2025-03-08 04:27:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901388711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:00,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 04:27:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881053502] [2025-03-08 04:27:00,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:00,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:27:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:00,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:27:00,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:27:00,242 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 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-03-08 04:27:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:01,007 INFO L93 Difference]: Finished difference Result 266 states and 321 transitions. [2025-03-08 04:27:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 04:27:01,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 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 26 [2025-03-08 04:27:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:01,009 INFO L225 Difference]: With dead ends: 266 [2025-03-08 04:27:01,009 INFO L226 Difference]: Without dead ends: 263 [2025-03-08 04:27:01,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-08 04:27:01,010 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 302 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:01,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 217 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 04:27:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-08 04:27:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 245. [2025-03-08 04:27:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 210 states have (on average 1.2476190476190476) internal successors, (262), 225 states have internal predecessors, (262), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:27:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 301 transitions. [2025-03-08 04:27:01,056 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 301 transitions. Word has length 26 [2025-03-08 04:27:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:01,056 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 301 transitions. [2025-03-08 04:27:01,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 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-03-08 04:27:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 301 transitions. [2025-03-08 04:27:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 04:27:01,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:01,057 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-03-08 04:27:01,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:27:01,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:01,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash -996062349, now seen corresponding path program 1 times [2025-03-08 04:27:01,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:01,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971005155] [2025-03-08 04:27:01,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:01,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:01,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 04:27:01,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 04:27:01,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:01,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:01,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:01,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971005155] [2025-03-08 04:27:01,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971005155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:01,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:01,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 04:27:01,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347725721] [2025-03-08 04:27:01,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:01,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:27:01,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:01,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:27:01,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:27:01,618 INFO L87 Difference]: Start difference. First operand 245 states and 301 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 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-03-08 04:27:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:02,435 INFO L93 Difference]: Finished difference Result 265 states and 319 transitions. [2025-03-08 04:27:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 04:27:02,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 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-03-08 04:27:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:02,437 INFO L225 Difference]: With dead ends: 265 [2025-03-08 04:27:02,438 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 04:27:02,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-08 04:27:02,439 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 341 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:02,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 217 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 04:27:02,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 04:27:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 245. [2025-03-08 04:27:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 210 states have (on average 1.2428571428571429) internal successors, (261), 225 states have internal predecessors, (261), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:27:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 300 transitions. [2025-03-08 04:27:02,465 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 300 transitions. Word has length 29 [2025-03-08 04:27:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:02,465 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 300 transitions. [2025-03-08 04:27:02,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 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-03-08 04:27:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 300 transitions. [2025-03-08 04:27:02,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 04:27:02,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:02,466 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-03-08 04:27:02,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 04:27:02,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:02,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 164503317, now seen corresponding path program 1 times [2025-03-08 04:27:02,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:02,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825314027] [2025-03-08 04:27:02,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:02,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:02,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 04:27:02,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 04:27:02,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:02,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:03,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:03,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825314027] [2025-03-08 04:27:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825314027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:03,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:03,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 04:27:03,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276833456] [2025-03-08 04:27:03,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:03,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:27:03,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:03,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:27:03,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:27:03,246 INFO L87 Difference]: Start difference. First operand 245 states and 300 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-03-08 04:27:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:04,136 INFO L93 Difference]: Finished difference Result 264 states and 317 transitions. [2025-03-08 04:27:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:27:04,139 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-03-08 04:27:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:04,141 INFO L225 Difference]: With dead ends: 264 [2025-03-08 04:27:04,141 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 04:27:04,142 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-03-08 04:27:04,143 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 335 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:04,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 232 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 04:27:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 04:27:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 245. [2025-03-08 04:27:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 210 states have (on average 1.2380952380952381) internal successors, (260), 225 states have internal predecessors, (260), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:27:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 299 transitions. [2025-03-08 04:27:04,164 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 299 transitions. Word has length 32 [2025-03-08 04:27:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:04,164 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 299 transitions. [2025-03-08 04:27:04,164 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-03-08 04:27:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 299 transitions. [2025-03-08 04:27:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 04:27:04,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:04,165 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-03-08 04:27:04,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 04:27:04,165 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:04,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash 84693392, now seen corresponding path program 1 times [2025-03-08 04:27:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:04,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310573205] [2025-03-08 04:27:04,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:04,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 04:27:04,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:27:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:04,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:04,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310573205] [2025-03-08 04:27:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310573205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:04,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:04,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 04:27:04,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759471951] [2025-03-08 04:27:04,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:04,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:27:04,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:04,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:27:04,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:27:04,942 INFO L87 Difference]: Start difference. First operand 245 states and 299 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-03-08 04:27:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:05,968 INFO L93 Difference]: Finished difference Result 263 states and 315 transitions. [2025-03-08 04:27:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 04:27:05,969 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-03-08 04:27:05,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:05,970 INFO L225 Difference]: With dead ends: 263 [2025-03-08 04:27:05,970 INFO L226 Difference]: Without dead ends: 260 [2025-03-08 04:27:05,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-03-08 04:27:05,971 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 334 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:05,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 283 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 04:27:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-08 04:27:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 245. [2025-03-08 04:27:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 210 states have (on average 1.2333333333333334) internal successors, (259), 225 states have internal predecessors, (259), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:27:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 298 transitions. [2025-03-08 04:27:06,007 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 298 transitions. Word has length 35 [2025-03-08 04:27:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:06,008 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 298 transitions. [2025-03-08 04:27:06,008 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-03-08 04:27:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 298 transitions. [2025-03-08 04:27:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 04:27:06,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:06,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:06,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 04:27:06,010 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:06,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1257071946, now seen corresponding path program 1 times [2025-03-08 04:27:06,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:06,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561787043] [2025-03-08 04:27:06,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:06,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:06,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 04:27:06,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:27:06,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:06,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:27:06,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:06,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561787043] [2025-03-08 04:27:06,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561787043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:06,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74790454] [2025-03-08 04:27:06,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:06,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:06,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:06,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:27:06,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:27:07,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 04:27:07,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:27:07,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:07,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:07,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 136 conjuncts are in the unsatisfiable core [2025-03-08 04:27:07,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:07,430 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:27:07,431 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-03-08 04:27:07,524 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-03-08 04:27:07,536 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-03-08 04:27:07,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:07,885 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 22 treesize of output 14 [2025-03-08 04:27:07,889 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 8 treesize of output 7 [2025-03-08 04:27:07,899 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 65 treesize of output 61 [2025-03-08 04:27:07,904 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 56 treesize of output 57 [2025-03-08 04:27:07,917 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 71 treesize of output 62 [2025-03-08 04:27:07,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2025-03-08 04:27:08,031 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-03-08 04:27:08,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 102 [2025-03-08 04:27:08,038 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 19 treesize of output 21 [2025-03-08 04:27:08,051 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:27:08,052 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 34 treesize of output 33 [2025-03-08 04:27:08,192 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2025-03-08 04:27:08,192 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-03-08 04:27:08,279 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 16 [2025-03-08 04:27:08,288 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 25 treesize of output 18 [2025-03-08 04:27:08,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:08,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:08,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2025-03-08 04:27:08,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 04:27:08,460 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-03-08 04:27:08,509 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-03-08 04:27:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:08,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:08,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_413 (Array Int Int)) (v_ArrVal_411 Int) (v_ArrVal_412 (Array Int Int))) (< |c_~#gl_list~0.offset| (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) v_ArrVal_412))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_413) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_411))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_403) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)))) is different from false [2025-03-08 04:27:08,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74790454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:08,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:27:08,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2025-03-08 04:27:08,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441643635] [2025-03-08 04:27:08,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:08,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 04:27:08,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:08,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 04:27:08,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1043, Unknown=29, NotChecked=66, Total=1260 [2025-03-08 04:27:08,928 INFO L87 Difference]: Start difference. First operand 245 states and 298 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 20 states have internal predecessors, (61), 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-03-08 04:27:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:13,014 INFO L93 Difference]: Finished difference Result 455 states and 542 transitions. [2025-03-08 04:27:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 04:27:13,015 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 20 states have internal predecessors, (61), 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 38 [2025-03-08 04:27:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:13,017 INFO L225 Difference]: With dead ends: 455 [2025-03-08 04:27:13,017 INFO L226 Difference]: Without dead ends: 452 [2025-03-08 04:27:13,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=571, Invalid=3159, Unknown=56, NotChecked=120, Total=3906 [2025-03-08 04:27:13,019 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1328 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 227 mSolverCounterUnsat, 330 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 330 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:13,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 487 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2616 Invalid, 330 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 04:27:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-08 04:27:13,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 339. [2025-03-08 04:27:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 294 states have (on average 1.227891156462585) internal successors, (361), 310 states have internal predecessors, (361), 34 states have call successors, (34), 12 states have call predecessors, (34), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 04:27:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 411 transitions. [2025-03-08 04:27:13,080 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 411 transitions. Word has length 38 [2025-03-08 04:27:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:13,081 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 411 transitions. [2025-03-08 04:27:13,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 20 states have internal predecessors, (61), 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-03-08 04:27:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 411 transitions. [2025-03-08 04:27:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 04:27:13,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:13,084 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] [2025-03-08 04:27:13,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 04:27:13,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:13,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:13,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1874296561, now seen corresponding path program 1 times [2025-03-08 04:27:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:13,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395590204] [2025-03-08 04:27:13,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:13,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 04:27:13,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:27:13,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:13,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:13,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:13,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395590204] [2025-03-08 04:27:13,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395590204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:13,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:13,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 04:27:13,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31970407] [2025-03-08 04:27:13,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:13,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:27:13,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:13,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:27:13,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:27:13,745 INFO L87 Difference]: Start difference. First operand 339 states and 411 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 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-03-08 04:27:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:14,476 INFO L93 Difference]: Finished difference Result 353 states and 423 transitions. [2025-03-08 04:27:14,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 04:27:14,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 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 38 [2025-03-08 04:27:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:14,479 INFO L225 Difference]: With dead ends: 353 [2025-03-08 04:27:14,482 INFO L226 Difference]: Without dead ends: 350 [2025-03-08 04:27:14,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2025-03-08 04:27:14,483 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 403 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:14,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 223 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 04:27:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-08 04:27:14,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 339. [2025-03-08 04:27:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 294 states have (on average 1.2244897959183674) internal successors, (360), 310 states have internal predecessors, (360), 34 states have call successors, (34), 12 states have call predecessors, (34), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 04:27:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 410 transitions. [2025-03-08 04:27:14,524 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 410 transitions. Word has length 38 [2025-03-08 04:27:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:14,524 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 410 transitions. [2025-03-08 04:27:14,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 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-03-08 04:27:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 410 transitions. [2025-03-08 04:27:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 04:27:14,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:14,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:14,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 04:27:14,525 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:14,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1544246496, now seen corresponding path program 1 times [2025-03-08 04:27:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:14,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728005313] [2025-03-08 04:27:14,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:14,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:27:14,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:27:14,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:14,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:15,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:15,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728005313] [2025-03-08 04:27:15,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728005313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:15,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990623438] [2025-03-08 04:27:15,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:15,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:15,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:15,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:27:15,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:27:15,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:27:15,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:27:15,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:15,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:15,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-03-08 04:27:15,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:16,009 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 04:27:16,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 04:27:16,068 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-03-08 04:27:16,078 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-03-08 04:27:17,846 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-03-08 04:27:17,899 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 22 treesize of output 25 [2025-03-08 04:27:17,946 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-03-08 04:27:18,494 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 137 treesize of output 125 [2025-03-08 04:27:18,498 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 120 treesize of output 121 [2025-03-08 04:27:18,503 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 79 treesize of output 7 [2025-03-08 04:27:18,507 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:18,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-03-08 04:27:18,512 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 42 treesize of output 23 [2025-03-08 04:27:18,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2025-03-08 04:27:18,523 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 27 treesize of output 17 [2025-03-08 04:27:18,525 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-03-08 04:27:18,607 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:27:18,608 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 52 treesize of output 45 [2025-03-08 04:27:18,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2025-03-08 04:27:18,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:27:18,709 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-03-08 04:27:18,784 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 27 treesize of output 18 [2025-03-08 04:27:18,789 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 28 treesize of output 19 [2025-03-08 04:27:36,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:36,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:37,969 INFO L349 Elim1Store]: treesize reduction 168, result has 29.1 percent of original size [2025-03-08 04:27:37,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 272 treesize of output 466 [2025-03-08 04:27:37,999 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 309 treesize of output 201 [2025-03-08 04:27:38,139 INFO L224 Elim1Store]: Index analysis took 105 ms [2025-03-08 04:27:38,997 INFO L349 Elim1Store]: treesize reduction 79, result has 27.5 percent of original size [2025-03-08 04:27:38,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 93 [2025-03-08 04:27:39,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:39,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:39,189 INFO L224 Elim1Store]: Index analysis took 147 ms [2025-03-08 04:27:39,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 59 treesize of output 140 [2025-03-08 04:27:39,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:39,544 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 29 treesize of output 33 [2025-03-08 04:27:39,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:39,749 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 29 treesize of output 33 [2025-03-08 04:27:40,446 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:40,649 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:40,742 INFO L224 Elim1Store]: Index analysis took 389 ms [2025-03-08 04:27:40,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 100 treesize of output 94 [2025-03-08 04:27:41,337 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:41,578 INFO L224 Elim1Store]: Index analysis took 673 ms [2025-03-08 04:27:41,811 INFO L349 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2025-03-08 04:27:41,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 138 treesize of output 136 [2025-03-08 04:27:41,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:41,854 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 29 treesize of output 15 [2025-03-08 04:27:44,719 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 04:27:44,720 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 1 case distinctions, treesize of input 124 treesize of output 94 [2025-03-08 04:27:44,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 15 [2025-03-08 04:27:44,767 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 27 treesize of output 18 [2025-03-08 04:27:44,889 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:44,900 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 131 treesize of output 99 [2025-03-08 04:27:44,925 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 68 treesize of output 15 [2025-03-08 04:27:45,216 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 04:27:45,217 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 1 case distinctions, treesize of input 176 treesize of output 142 [2025-03-08 04:27:45,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:45,340 INFO L224 Elim1Store]: Index analysis took 108 ms [2025-03-08 04:27:45,372 INFO L349 Elim1Store]: treesize reduction 164, result has 0.6 percent of original size [2025-03-08 04:27:45,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 102 treesize of output 15 [2025-03-08 04:27:45,633 INFO L349 Elim1Store]: treesize reduction 44, result has 26.7 percent of original size [2025-03-08 04:27:45,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 29 [2025-03-08 04:27:45,787 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:45,800 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 172 treesize of output 138 [2025-03-08 04:27:45,922 INFO L224 Elim1Store]: Index analysis took 106 ms [2025-03-08 04:27:45,952 INFO L349 Elim1Store]: treesize reduction 164, result has 0.6 percent of original size [2025-03-08 04:27:45,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 15 [2025-03-08 04:27:46,218 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:46,231 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 176 treesize of output 144 [2025-03-08 04:27:46,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:46,392 INFO L224 Elim1Store]: Index analysis took 118 ms [2025-03-08 04:27:46,422 INFO L349 Elim1Store]: treesize reduction 164, result has 0.6 percent of original size [2025-03-08 04:27:46,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 15 [2025-03-08 04:27:46,722 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 04:27:46,722 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 1 case distinctions, treesize of input 169 treesize of output 139 [2025-03-08 04:27:46,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:46,856 INFO L349 Elim1Store]: treesize reduction 164, result has 0.6 percent of original size [2025-03-08 04:27:46,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 102 treesize of output 15 [2025-03-08 04:27:46,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:46,920 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-08 04:27:46,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 22 [2025-03-08 04:27:47,160 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:47,169 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 176 treesize of output 144 [2025-03-08 04:27:47,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:47,289 INFO L224 Elim1Store]: Index analysis took 104 ms [2025-03-08 04:27:47,316 INFO L349 Elim1Store]: treesize reduction 164, result has 0.6 percent of original size [2025-03-08 04:27:47,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 15 [2025-03-08 04:27:47,616 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 04:27:47,616 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 1 case distinctions, treesize of input 180 treesize of output 148 [2025-03-08 04:27:47,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:47,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:47,738 INFO L224 Elim1Store]: Index analysis took 104 ms [2025-03-08 04:27:47,768 INFO L349 Elim1Store]: treesize reduction 164, result has 0.6 percent of original size [2025-03-08 04:27:47,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 102 treesize of output 15 [2025-03-08 04:27:47,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:47,905 INFO L349 Elim1Store]: treesize reduction 102, result has 6.4 percent of original size [2025-03-08 04:27:47,905 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 29 [2025-03-08 04:27:50,630 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:50,641 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 76 treesize of output 46 [2025-03-08 04:27:50,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 29 treesize of output 15 [2025-03-08 04:27:54,996 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:55,008 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 76 treesize of output 48 [2025-03-08 04:27:55,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 29 treesize of output 15 [2025-03-08 04:27:57,426 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| 3))) (let ((.cse4 (select .cse10 0))) (let ((.cse22 (select .cse10 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse6 (+ .cse4 4))) (let ((.cse0 (= (select .cse3 .cse6) 0)) (.cse1 (<= 4 .cse22)) (.cse8 (select .cse3 .cse4)) (.cse52 (<= .cse4 .cse22)) (.cse53 (<= 4 .cse4))) (or (and .cse0 .cse1 (or (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_37) 3 v_DerPreprocessor_38) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse9 (select v_DerPreprocessor_38 0)) (.cse5 (select .cse2 .cse4)) (.cse7 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_38) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (and (= .cse2 (store (store .cse3 .cse4 .cse5) .cse6 0)) (= (select .cse7 .cse4) .cse8) (= .cse9 .cse4) (= (store .cse10 0 .cse9) v_DerPreprocessor_38) (= .cse5 .cse8) (= (select .cse7 .cse6) 0))))) (exists ((v_arrayElimCell_47 Int)) (and (not (= 3 v_arrayElimCell_47)) (exists ((v_DerPreprocessor_38 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_38 0))) (and (= .cse11 .cse4) (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47 v_DerPreprocessor_36) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_37) 3 v_DerPreprocessor_38))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse12 (select .cse17 v_arrayElimCell_47)) (.cse13 (select .cse16 .cse4))) (and (= .cse12 v_DerPreprocessor_36) (= .cse13 .cse8) (exists ((v_prenex_150 (Array Int Int)) (v_prenex_149 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47 v_prenex_149) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_prenex_150) 3 v_DerPreprocessor_38))) (let ((.cse14 (select .cse15 v_arrayElimCell_47))) (and (= .cse14 v_prenex_149) (= (store (store .cse14 .cse4 .cse8) .cse6 0) (select .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= .cse12 .cse14))))) (= (store (store .cse3 .cse4 .cse13) .cse6 0) .cse16)))))) (= (store .cse10 0 .cse11) v_DerPreprocessor_38)))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_115 Int) (v_prenex_113 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_prenex_114 (Array Int Int))) (let ((.cse21 (select v_DerPreprocessor_11 0)) (.cse18 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10) 3 v_DerPreprocessor_11) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse20 (select .cse10 v_prenex_113)) (.cse19 (select v_DerPreprocessor_11 v_prenex_113))) (and (= .cse18 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_prenex_114) 3 v_DerPreprocessor_11) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= .cse19 .cse20) (= (select .cse3 (+ (select .cse10 v_prenex_115) 4)) v_prenex_115) (<= 4 .cse21) (<= v_prenex_115 0) (= .cse4 .cse21) (= (select .cse18 (+ .cse20 4)) v_prenex_113) (<= .cse21 .cse22) (= (select .cse3 .cse20) (select .cse18 .cse20)) (= v_DerPreprocessor_11 (store (store .cse10 v_prenex_115 (select v_DerPreprocessor_11 v_prenex_115)) v_prenex_113 .cse19))))) (exists ((v_prenex_127 Int) (v_prenex_125 Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse25 (select .cse10 v_prenex_125))) (let ((.cse27 (select .cse10 v_prenex_127)) (.cse28 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_16) 3 v_DerPreprocessor_17) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse31 (+ 4 .cse25))) (let ((.cse24 (select v_DerPreprocessor_17 v_prenex_125)) (.cse23 (select v_DerPreprocessor_17 0)) (.cse26 (select .cse28 .cse31)) (.cse32 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_prenex_126) 3 v_DerPreprocessor_17) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse29 (+ .cse27 4)) (.cse30 (select .cse28 .cse25)) (.cse33 (select .cse3 .cse25))) (and (<= .cse23 .cse22) (= .cse24 .cse25) (<= 4 .cse23) (= v_DerPreprocessor_17 (store (store .cse10 v_prenex_127 (select v_DerPreprocessor_17 v_prenex_127)) v_prenex_125 .cse24)) (= .cse26 v_prenex_125) (= .cse4 .cse23) (<= v_prenex_127 0) (= (store (store (store (store .cse3 .cse27 (select .cse28 .cse27)) .cse29 (select .cse28 .cse29)) .cse25 .cse30) .cse31 .cse26) .cse28) (= (select .cse32 .cse25) .cse33) (= (select .cse32 .cse31) v_prenex_125) (= (select .cse3 .cse29) v_prenex_127) (= .cse30 .cse33)))))) (and (or (exists ((v_prenex_121 (Array Int Int)) (v_prenex_120 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse39 (select .cse10 v_prenex_120))) (let ((.cse37 (select v_DerPreprocessor_14 v_prenex_120)) (.cse34 (select v_DerPreprocessor_14 0)) (.cse40 (select .cse3 .cse39)) (.cse35 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_13) 3 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse38 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_prenex_121) 3 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse36 (+ 4 .cse39))) (and (<= 4 .cse34) (= v_prenex_120 (select .cse35 .cse36)) (= v_DerPreprocessor_14 (store (store .cse10 0 .cse34) v_prenex_120 .cse37)) (= (select .cse38 .cse39) .cse40) (= .cse37 .cse39) (<= .cse34 .cse22) (= .cse40 (select .cse35 .cse39)) (= (select .cse38 .cse36) v_prenex_120))))) (exists ((v_prenex_2 Int) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse44 (select v_DerPreprocessor_14 v_prenex_2)) (.cse42 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_13) 3 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse43 (select .cse10 v_prenex_2)) (.cse41 (select v_DerPreprocessor_14 0))) (and (<= 4 .cse41) (= (select .cse42 (+ .cse43 4)) v_prenex_2) (= .cse44 .cse43) (= (store (store .cse10 0 .cse41) v_prenex_2 .cse44) v_DerPreprocessor_14) (= .cse42 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse3 .cse43) (select .cse42 .cse43)) (<= .cse41 .cse22))))) .cse0) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_2 Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimCell_92 Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse47 (select .cse10 v_prenex_2))) (let ((.cse46 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_11) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse48 (+ .cse47 4)) (.cse50 (select v_DerPreprocessor_11 v_prenex_2)) (.cse45 (select .cse3 .cse47)) (.cse49 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10) 3 v_DerPreprocessor_11) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse51 (select v_DerPreprocessor_11 0))) (and (= .cse45 (select .cse46 .cse47)) (= (select .cse3 (+ (select .cse10 v_arrayElimCell_92) 4)) v_arrayElimCell_92) (= (select .cse46 .cse48) v_prenex_2) (= (select .cse49 .cse48) v_prenex_2) (= .cse47 .cse50) (<= 4 .cse51) (= (store (store .cse10 v_arrayElimCell_92 (select v_DerPreprocessor_11 v_arrayElimCell_92)) v_prenex_2 .cse50) v_DerPreprocessor_11) (= .cse4 .cse51) (= .cse45 (select .cse49 .cse47)) (<= .cse51 .cse22) (<= v_arrayElimCell_92 0))))) (and .cse52 .cse53 (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse54 (select v_DerPreprocessor_23 0)) (.cse55 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_23) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (and (= v_DerPreprocessor_23 (store (store .cse10 v_arrayElimCell_78 (select v_DerPreprocessor_23 v_arrayElimCell_78)) 0 .cse54)) (= .cse4 .cse54) (= .cse55 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_22) 3 v_DerPreprocessor_23) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (<= v_arrayElimCell_78 0) (= .cse55 (store (store .cse55 .cse4 .cse8) .cse6 0)) (= (select .cse3 (+ (select .cse10 v_arrayElimCell_78) 4)) v_arrayElimCell_78))))) (and (or (exists ((v_arrayElimCell_47 Int)) (and (not (= 3 v_arrayElimCell_47)) (exists ((v_DerPreprocessor_20 (Array Int Int))) (let ((.cse56 (select v_DerPreprocessor_20 0))) (and (<= 4 .cse56) (<= .cse56 .cse22) (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse67 (store (store (store |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47 v_DerPreprocessor_18) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_19) 3 v_DerPreprocessor_20))) (let ((.cse65 (select .cse67 v_arrayElimCell_47))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_prenex_2 Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse59 (select .cse10 v_prenex_2))) (let ((.cse62 (store (store (store |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47 v_DerPreprocessor_3) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_20)) (.cse61 (+ .cse59 4)) (.cse66 (select .cse67 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse60 (select .cse3 .cse59)) (.cse64 (select v_DerPreprocessor_20 v_prenex_2)) (.cse63 (select .cse66 .cse59)) (.cse57 (select .cse66 .cse61)) (.cse58 (select .cse62 v_arrayElimCell_47))) (and (= .cse57 v_prenex_2) (= (store (store .cse58 .cse59 .cse60) .cse61 v_prenex_2) (select .cse62 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= .cse60 .cse63) (= v_DerPreprocessor_20 (store (store .cse10 0 .cse56) v_prenex_2 .cse64)) (= .cse58 .cse65) (= .cse64 .cse59) (= (store (store (store (store .cse3 .cse4 (select .cse66 .cse4)) .cse6 (select .cse66 .cse6)) .cse59 .cse63) .cse61 .cse57) .cse66) (= .cse58 v_DerPreprocessor_3)))))) (= .cse65 v_DerPreprocessor_18)))))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_132 (Array Int Int)) (v_prenex_131 Int)) (let ((.cse72 (select .cse10 v_prenex_131))) (let ((.cse71 (+ .cse72 4)) (.cse76 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_19) 3 v_DerPreprocessor_20) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse69 (select v_DerPreprocessor_20 v_prenex_131)) (.cse68 (select v_DerPreprocessor_20 0)) (.cse73 (select .cse3 .cse72)) (.cse70 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_prenex_132) 3 v_DerPreprocessor_20) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse74 (select .cse76 .cse72)) (.cse75 (select .cse76 .cse71))) (and (= v_DerPreprocessor_20 (store (store .cse10 0 .cse68) v_prenex_131 .cse69)) (<= 4 .cse68) (= v_prenex_131 (select .cse70 .cse71)) (= .cse72 .cse69) (<= .cse68 .cse22) (= .cse73 .cse74) (= .cse75 v_prenex_131) (= .cse73 (select .cse70 .cse72)) (= .cse76 (store (store (store (store .cse3 .cse4 (select .cse76 .cse4)) .cse6 (select .cse76 .cse6)) .cse72 .cse74) .cse71 .cse75)))))))) .cse0) (and (or (and .cse0 .cse1) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_arrayElimCell_47 Int)) (let ((.cse78 (store (store (store |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47 v_DerPreprocessor_6) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) 3 .cse10))) (let ((.cse77 (select .cse78 v_arrayElimCell_47))) (and (not (= 3 v_arrayElimCell_47)) (= .cse77 (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47)) (= (store (store .cse77 .cse4 .cse8) .cse6 0) (select .cse78 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))))) .cse0 .cse1)) (not (= .cse4 0))) (exists ((v_arrayElimCell_47 Int)) (and (not (= 3 v_arrayElimCell_47)) (exists ((v_DerPreprocessor_17 (Array Int Int))) (let ((.cse79 (select v_DerPreprocessor_17 0))) (and (<= .cse79 .cse22) (<= 4 .cse79) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse92 (store (store (store |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47 v_DerPreprocessor_15) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_16) 3 v_DerPreprocessor_17))) (let ((.cse91 (select .cse92 v_arrayElimCell_47))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_prenex_2 Int) (v_DerPreprocessor_4 (Array Int Int)) (|v_list_add___list_add_~prev#1.offset_27| Int)) (let ((.cse84 (select .cse10 v_prenex_2))) (let ((.cse89 (select .cse10 |v_list_add___list_add_~prev#1.offset_27|)) (.cse87 (store (store (store |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47 v_DerPreprocessor_3) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_17)) (.cse86 (+ .cse84 4)) (.cse88 (select .cse92 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse81 (select .cse3 .cse84)) (.cse82 (select .cse88 .cse84)) (.cse80 (select .cse88 .cse86)) (.cse85 (select .cse87 v_arrayElimCell_47)) (.cse83 (select v_DerPreprocessor_17 v_prenex_2)) (.cse90 (+ .cse89 4))) (and (= .cse80 v_prenex_2) (= .cse81 .cse82) (<= |v_list_add___list_add_~prev#1.offset_27| 0) (= .cse83 .cse84) (= (store (store .cse85 .cse84 .cse81) .cse86 v_prenex_2) (select .cse87 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= .cse85 v_DerPreprocessor_3) (= .cse88 (store (store (store (store .cse3 .cse89 (select .cse88 .cse89)) .cse90 (select .cse88 .cse90)) .cse84 .cse82) .cse86 .cse80)) (= .cse91 .cse85) (= (store (store .cse10 |v_list_add___list_add_~prev#1.offset_27| (select v_DerPreprocessor_17 |v_list_add___list_add_~prev#1.offset_27|)) v_prenex_2 .cse83) v_DerPreprocessor_17) (= (select .cse3 .cse90) |v_list_add___list_add_~prev#1.offset_27|)))))) (= v_DerPreprocessor_15 .cse91))))) (= .cse4 .cse79)))))) (and .cse52 .cse53 (exists ((v_prenex_2 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_arrayElimCell_47 Int)) (let ((.cse93 (select .cse10 v_prenex_2)) (.cse96 (store (store (store |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47 v_DerPreprocessor_6) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) 3 .cse10))) (let ((.cse95 (select .cse96 v_arrayElimCell_47)) (.cse94 (+ .cse93 4))) (and (not (= v_prenex_2 .cse93)) (= (select .cse3 .cse94) v_prenex_2) (not (= 3 v_arrayElimCell_47)) (<= v_prenex_2 0) (= .cse95 (select |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47)) (= (store (store .cse95 .cse93 (select .cse3 .cse93)) .cse94 v_prenex_2) (select .cse96 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))))) (and .cse0 (or (exists ((v_prenex_146 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse97 (select v_DerPreprocessor_35 0)) (.cse98 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_34) 3 v_DerPreprocessor_35) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (and (= .cse97 .cse4) (= (select .cse98 .cse4) .cse8) (= v_DerPreprocessor_35 (store .cse10 0 .cse97)) (= (select .cse98 .cse6) 0) (= .cse98 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_prenex_146) 3 v_DerPreprocessor_35) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse101 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_35) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse99 (select v_DerPreprocessor_35 0)) (.cse100 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_34) 3 v_DerPreprocessor_35) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (and (= .cse99 .cse4) (= (select .cse100 .cse4) .cse8) (= (select .cse101 .cse6) 0) (= (select .cse101 .cse4) .cse8) (= v_DerPreprocessor_35 (store .cse10 0 .cse99)) (= (select .cse100 .cse6) 0))))) .cse1) (and .cse52 .cse53 (exists ((v_DerPreprocessor_3 (Array Int Int)) (|v_list_add___list_add_~prev#1.offset_27| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimCell_47 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse110 (store (store (store |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47 v_DerPreprocessor_24) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26))) (let ((.cse109 (store (store (store |c_#memory_$Pointer$#1.offset| v_arrayElimCell_47 v_DerPreprocessor_3) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_26)) (.cse104 (select .cse10 |v_list_add___list_add_~prev#1.offset_27|)) (.cse103 (select .cse110 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse102 (select .cse103 .cse4)) (.cse107 (select .cse110 v_arrayElimCell_47)) (.cse105 (+ .cse104 4)) (.cse106 (select .cse109 v_arrayElimCell_47)) (.cse108 (select v_DerPreprocessor_26 0))) (and (= .cse102 .cse8) (= .cse103 (store (store (store (store .cse3 .cse104 (select .cse103 .cse104)) .cse105 (select .cse103 .cse105)) .cse4 .cse102) .cse6 0)) (<= |v_list_add___list_add_~prev#1.offset_27| 0) (= .cse106 v_DerPreprocessor_3) (not (= 3 v_arrayElimCell_47)) (= v_DerPreprocessor_24 .cse107) (= .cse106 .cse107) (= .cse4 .cse108) (= (select .cse3 .cse105) |v_list_add___list_add_~prev#1.offset_27|) (= (select .cse109 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (store (store .cse106 .cse4 .cse8) .cse6 0)) (= (store (store .cse10 |v_list_add___list_add_~prev#1.offset_27| (select v_DerPreprocessor_26 |v_list_add___list_add_~prev#1.offset_27|)) 0 .cse108) v_DerPreprocessor_26))))))) (and .cse52 .cse53 (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse112 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse111 (select v_DerPreprocessor_29 0)) (.cse113 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28) 3 v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (and (= v_DerPreprocessor_29 (store (store .cse10 v_arrayElimCell_78 (select v_DerPreprocessor_29 v_arrayElimCell_78)) 0 .cse111)) (= (select .cse112 .cse4) .cse8) (= (select .cse113 .cse6) 0) (<= v_arrayElimCell_78 0) (= (select .cse112 .cse6) 0) (= .cse111 .cse4) (= (select .cse3 (+ (select .cse10 v_arrayElimCell_78) 4)) v_arrayElimCell_78) (= (select .cse113 .cse4) .cse8))))) (and .cse52 .cse53 (exists ((v_arrayElimCell_104 Int)) (let ((.cse114 (select .cse10 v_arrayElimCell_104))) (and (<= v_arrayElimCell_104 0) (= v_arrayElimCell_104 (select .cse3 (+ 4 .cse114))) (not (= v_arrayElimCell_104 .cse114)))))) (and (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_list_add___list_add_~prev#1.offset_27| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse118 (select .cse10 |v_list_add___list_add_~prev#1.offset_27|)) (.cse117 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_31) 3 v_DerPreprocessor_32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse116 (select .cse117 .cse4)) (.cse119 (+ .cse118 4)) (.cse115 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse120 (select v_DerPreprocessor_32 0))) (and (= .cse8 (select .cse115 .cse4)) (= .cse116 .cse8) (= .cse117 (store (store (store (store .cse3 .cse118 (select .cse117 .cse118)) .cse119 (select .cse117 .cse119)) .cse4 .cse116) .cse6 0)) (<= |v_list_add___list_add_~prev#1.offset_27| 0) (= .cse4 .cse120) (= (select .cse3 .cse119) |v_list_add___list_add_~prev#1.offset_27|) (= (select .cse115 .cse6) 0) (= v_DerPreprocessor_32 (store (store .cse10 |v_list_add___list_add_~prev#1.offset_27| (select v_DerPreprocessor_32 |v_list_add___list_add_~prev#1.offset_27|)) 0 .cse120)))))) .cse52 .cse53)))))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3))) is different from true [2025-03-08 04:27:57,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:58,544 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2025-03-08 04:27:58,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 5633 treesize of output 4870 [2025-03-08 04:27:58,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:58,642 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 2456 treesize of output 2442 [2025-03-08 04:27:58,692 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 2442 treesize of output 2428 [2025-03-08 04:27:58,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:58,761 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 2428 treesize of output 2414 [2025-03-08 04:27:58,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:58,822 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 2414 treesize of output 2400 [2025-03-08 04:27:58,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:58,885 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 2400 treesize of output 2386 [2025-03-08 04:27:58,955 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 2386 treesize of output 2372 [2025-03-08 04:27:59,022 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 2372 treesize of output 2358 [2025-03-08 04:27:59,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:59,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 2358 treesize of output 2344 [2025-03-08 04:27:59,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:59,186 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 2344 treesize of output 2330 [2025-03-08 04:27:59,266 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 2330 treesize of output 2316 [2025-03-08 04:27:59,360 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 2316 treesize of output 2302 [2025-03-08 04:27:59,449 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 2302 treesize of output 2288 [2025-03-08 04:27:59,664 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 27 treesize of output 13 [2025-03-08 04:27:59,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:59,776 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 27 treesize of output 13 [2025-03-08 04:27:59,889 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 27 treesize of output 13 [2025-03-08 04:28:01,025 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 25 treesize of output 27 [2025-03-08 04:28:01,088 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 27 treesize of output 13 [2025-03-08 04:28:01,801 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 25 treesize of output 27 [2025-03-08 04:28:01,896 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 27 treesize of output 13 [2025-03-08 04:28:03,021 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 11 treesize of output 3 [2025-03-08 04:28:03,078 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 11 treesize of output 3 [2025-03-08 04:28:03,488 INFO L349 Elim1Store]: treesize reduction 360, result has 9.8 percent of original size [2025-03-08 04:28:03,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 269 treesize of output 332 [2025-03-08 04:28:03,605 INFO L349 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2025-03-08 04:28:03,605 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 298 treesize of output 186 [2025-03-08 04:28:03,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:28:03,834 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 208 treesize of output 206 [2025-03-08 04:28:03,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-08 04:28:04,072 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 11 treesize of output 3 [2025-03-08 04:28:04,084 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 11 treesize of output 3 [2025-03-08 04:28:04,148 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 11 treesize of output 3 [2025-03-08 04:28:04,153 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:28:04,156 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,157 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,158 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:28:04,180 INFO L349 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2025-03-08 04:28:04,180 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 1273 treesize of output 1205 [2025-03-08 04:28:04,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,206 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:28:04,208 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,209 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,210 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:28:04,216 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,217 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,218 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:28:04,222 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:28:04,225 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,225 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,228 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:28:04,232 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,233 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:28:04,234 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:28:05,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 04:28:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-08 04:28:06,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:28:09,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990623438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:28:09,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:28:09,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2025-03-08 04:28:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706166597] [2025-03-08 04:28:09,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:28:09,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 04:28:09,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:28:09,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 04:28:09,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1345, Unknown=28, NotChecked=74, Total=1560 [2025-03-08 04:28:09,158 INFO L87 Difference]: Start difference. First operand 339 states and 410 transitions. Second operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 23 states have internal predecessors, (69), 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-03-08 04:28:14,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]