./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_unequal.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/list-simple/sll2c_append_unequal.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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:34:31,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:34:31,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:34:31,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:34:31,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:34:31,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:34:31,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:34:31,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:34:31,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:34:31,550 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:34:31,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:34:31,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:34:31,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:34:31,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:34:31,550 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:34:31,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:34:31,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:34:31,552 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:34:31,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:34:31,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:34:31,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:34:31,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:34:31,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:34:31,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:34:31,553 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:34:31,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:34:31,553 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:34:31,553 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:34:31,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:34:31,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:34:31,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:34:31,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:34:31,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:34:31,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:34:31,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:34:31,554 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:34:31,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:34:31,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:34:31,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:34:31,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:34:31,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:34:31,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:34:31,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:34:31,555 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2025-03-08 04:34:31,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:34:31,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:34:31,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:34:31,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:34:31,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:34:31,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2025-03-08 04:34:32,875 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298671ae9/086639b4745d4e6fb8baab51a4cb87e4/FLAG747571793 [2025-03-08 04:34:33,097 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:34:33,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2025-03-08 04:34:33,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298671ae9/086639b4745d4e6fb8baab51a4cb87e4/FLAG747571793 [2025-03-08 04:34:33,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298671ae9/086639b4745d4e6fb8baab51a4cb87e4 [2025-03-08 04:34:33,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:34:33,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:34:33,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:34:33,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:34:33,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:34:33,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a335aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33, skipping insertion in model container [2025-03-08 04:34:33,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:34:33,347 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/list-simple/sll2c_append_unequal.i[24587,24600] [2025-03-08 04:34:33,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:34:33,357 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:34:33,403 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/list-simple/sll2c_append_unequal.i[24587,24600] [2025-03-08 04:34:33,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:34:33,425 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:34:33,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33 WrapperNode [2025-03-08 04:34:33,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:34:33,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:34:33,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:34:33,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:34:33,431 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:34:33" (1/1) ... [2025-03-08 04:34:33,442 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:34:33" (1/1) ... [2025-03-08 04:34:33,462 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2025-03-08 04:34:33,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:34:33,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:34:33,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:34:33,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:34:33,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,494 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 16, 10]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2025-03-08 04:34:33,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:34:33,514 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:34:33,517 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:34:33,517 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:34:33,518 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (1/1) ... [2025-03-08 04:34:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:34:33,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:33,548 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:34:33,551 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:34:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:34:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:34:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 04:34:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:34:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:34:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 04:34:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-08 04:34:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-08 04:34:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:34:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:34:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 04:34:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:34:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:34:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 04:34:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:34:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:34:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 04:34:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:34:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:34:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:34:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 04:34:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:34:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:34:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 04:34:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:34:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:34:33,690 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:34:33,691 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:34:33,824 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-08 04:34:33,834 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 04:34:33,843 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-08 04:34:33,843 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:34:33,849 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:34:33,849 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:34:33,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:33 BoogieIcfgContainer [2025-03-08 04:34:33,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:34:33,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:34:33,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:34:33,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:34:33,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:34:33" (1/3) ... [2025-03-08 04:34:33,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6114aa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:33, skipping insertion in model container [2025-03-08 04:34:33,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:33" (2/3) ... [2025-03-08 04:34:33,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6114aa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:33, skipping insertion in model container [2025-03-08 04:34:33,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:33" (3/3) ... [2025-03-08 04:34:33,855 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2025-03-08 04:34:33,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:34:33,867 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_unequal.i that has 2 procedures, 37 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 04:34:33,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:34:33,916 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;@7a9bbec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:34:33,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:34:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 04:34:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 04:34:33,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:33,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:34:33,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:33,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:33,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1999437092, now seen corresponding path program 1 times [2025-03-08 04:34:33,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:33,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105424423] [2025-03-08 04:34:33,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:34,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 04:34:34,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:34:34,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:34,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:34:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:34,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105424423] [2025-03-08 04:34:34,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105424423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:34:34,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:34:34,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:34:34,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355248157] [2025-03-08 04:34:34,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:34:34,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:34:34,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:34,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:34:34,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:34:34,257 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:34:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:34,278 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2025-03-08 04:34:34,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:34:34,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-08 04:34:34,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:34,283 INFO L225 Difference]: With dead ends: 70 [2025-03-08 04:34:34,283 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 04:34:34,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:34:34,289 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:34,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 04:34:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-08 04:34:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 04:34:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-08 04:34:34,317 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 24 [2025-03-08 04:34:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:34,317 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-08 04:34:34,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:34:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-08 04:34:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:34:34,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:34,318 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:34:34,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:34:34,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:34,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 846332882, now seen corresponding path program 1 times [2025-03-08 04:34:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:34,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963158272] [2025-03-08 04:34:34,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:34,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:34,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:34:34,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:34:34,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:34,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:34,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963158272] [2025-03-08 04:34:34,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963158272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:34,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936550621] [2025-03-08 04:34:34,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:34,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:34,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:34,692 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:34:34,693 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:34:34,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:34:34,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:34:34,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:34,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:34,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 04:34:34,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:34,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-08 04:34:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:34:34,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:34:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:35,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936550621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:34:35,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:34:35,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-03-08 04:34:35,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086513194] [2025-03-08 04:34:35,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:34:35,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:34:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:35,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:34:35,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:34:35,029 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 04:34:39,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 04:34:43,071 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] [2025-03-08 04:34:47,085 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] [2025-03-08 04:34:51,206 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] [2025-03-08 04:34:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:51,214 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2025-03-08 04:34:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 04:34:51,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2025-03-08 04:34:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:51,215 INFO L225 Difference]: With dead ends: 49 [2025-03-08 04:34:51,216 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 04:34:51,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-08 04:34:51,216 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 21 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:51,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 293 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-03-08 04:34:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 04:34:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-08 04:34:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 04:34:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-08 04:34:51,223 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 33 [2025-03-08 04:34:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:51,223 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-08 04:34:51,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 04:34:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-08 04:34:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:34:51,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:51,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:34:51,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:34:51,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:51,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:51,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:51,426 INFO L85 PathProgramCache]: Analyzing trace with hash 888535511, now seen corresponding path program 1 times [2025-03-08 04:34:51,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:51,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890869708] [2025-03-08 04:34:51,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:51,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:51,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:34:51,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:34:51,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:51,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:34:52,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:52,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890869708] [2025-03-08 04:34:52,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890869708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:52,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304056268] [2025-03-08 04:34:52,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:52,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:52,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:52,101 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:34:52,103 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:34:52,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:34:52,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:34:52,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:52,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:52,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-08 04:34:52,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:52,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 04:34:52,407 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:34:52,407 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:34:52,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:34:52,504 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:34:52,505 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:34:52,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 04:34:52,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 04:34:52,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:34:52,795 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 48 treesize of output 32 [2025-03-08 04:34:52,811 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 04:34:52,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 04:34:53,240 INFO L349 Elim1Store]: treesize reduction 98, result has 36.8 percent of original size [2025-03-08 04:34:53,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 102 [2025-03-08 04:34:53,272 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2025-03-08 04:34:53,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2025-03-08 04:34:53,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2025-03-08 04:34:53,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-03-08 04:34:53,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-03-08 04:34:53,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2025-03-08 04:34:53,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-08 04:35:18,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:18,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 211 [2025-03-08 04:35:18,112 INFO L349 Elim1Store]: treesize reduction 12, result has 90.1 percent of original size [2025-03-08 04:35:18,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 208 [2025-03-08 04:35:18,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:18,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 133 [2025-03-08 04:35:18,159 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 97 treesize of output 77 [2025-03-08 04:35:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:19,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:19,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:19,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 271 [2025-03-08 04:35:19,110 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 304 treesize of output 280 [2025-03-08 04:35:19,180 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 44 treesize of output 38 [2025-03-08 04:35:19,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2025-03-08 04:35:19,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2025-03-08 04:35:19,211 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 04:35:19,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304056268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:19,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:35:19,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 36 [2025-03-08 04:35:19,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884978924] [2025-03-08 04:35:19,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:35:19,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 04:35:19,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:19,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 04:35:19,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1827, Unknown=6, NotChecked=0, Total=1980 [2025-03-08 04:35:19,968 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 36 states, 34 states have (on average 1.5) internal successors, (51), 29 states have internal predecessors, (51), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 04:35:32,391 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] [2025-03-08 04:35:40,460 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] [2025-03-08 04:35:48,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 04:35:56,631 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] [2025-03-08 04:36:00,641 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] [2025-03-08 04:36:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:01,020 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2025-03-08 04:36:01,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 04:36:01,021 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.5) internal successors, (51), 29 states have internal predecessors, (51), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-03-08 04:36:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:01,023 INFO L225 Difference]: With dead ends: 82 [2025-03-08 04:36:01,023 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 04:36:01,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 46.2s TimeCoverageRelationStatistics Valid=265, Invalid=3030, Unknown=11, NotChecked=0, Total=3306 [2025-03-08 04:36:01,025 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 57 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 10 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:01,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 499 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 708 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2025-03-08 04:36:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 04:36:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2025-03-08 04:36:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:36:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-08 04:36:01,034 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 36 [2025-03-08 04:36:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:01,034 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-08 04:36:01,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.5) internal successors, (51), 29 states have internal predecessors, (51), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 04:36:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-08 04:36:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 04:36:01,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:01,035 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:01,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:36:01,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 04:36:01,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:01,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1713795065, now seen corresponding path program 1 times [2025-03-08 04:36:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:01,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353787288] [2025-03-08 04:36:01,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:01,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 04:36:01,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:36:01,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:01,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:36:02,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:02,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353787288] [2025-03-08 04:36:02,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353787288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:02,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273822442] [2025-03-08 04:36:02,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:02,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:02,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:02,743 INFO L229 MonitoredProcess]: Starting monitored process 4 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:36:02,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:36:02,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 04:36:03,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:36:03,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:03,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:03,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-08 04:36:03,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:03,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 04:36:03,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:36:03,392 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:36:03,393 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:36:03,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 04:36:03,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:36:03,507 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:36:03,507 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 50 treesize of output 45 [2025-03-08 04:36:03,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 04:36:03,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 04:36:03,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-08 04:36:03,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 04:36:03,790 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:36:03,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-08 04:36:03,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:36:03,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-03-08 04:36:03,828 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 04:36:03,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 04:36:04,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2025-03-08 04:36:04,147 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 25 treesize of output 15 [2025-03-08 04:36:04,198 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 04:36:04,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 04:36:04,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 04:36:04,255 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 26 treesize of output 14 [2025-03-08 04:36:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:36:04,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:36:04,474 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 12 treesize of output 8 [2025-03-08 04:36:04,600 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) v_ArrVal_442) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_441) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-03-08 04:36:08,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273822442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:08,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:36:08,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 45 [2025-03-08 04:36:08,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970699042] [2025-03-08 04:36:08,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:36:08,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 04:36:08,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:08,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 04:36:08,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2577, Unknown=38, NotChecked=102, Total=2862 [2025-03-08 04:36:08,867 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 45 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 38 states have internal predecessors, (66), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 04:36:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:11,196 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2025-03-08 04:36:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 04:36:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 38 states have internal predecessors, (66), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2025-03-08 04:36:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:11,198 INFO L225 Difference]: With dead ends: 111 [2025-03-08 04:36:11,198 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 04:36:11,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=453, Invalid=6990, Unknown=43, NotChecked=170, Total=7656 [2025-03-08 04:36:11,200 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 140 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:11,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 666 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 04:36:11,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 04:36:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2025-03-08 04:36:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 67 states have internal predecessors, (80), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:36:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-03-08 04:36:11,209 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 40 [2025-03-08 04:36:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:11,210 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-08 04:36:11,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 38 states have internal predecessors, (66), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 04:36:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-03-08 04:36:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 04:36:11,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:11,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:11,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 04:36:11,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:11,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:11,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1230707110, now seen corresponding path program 2 times [2025-03-08 04:36:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:11,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-08 04:36:11,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:11,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-08 04:36:11,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 04:36:11,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:36:11,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:36:14,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:14,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-08 04:36:14,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452200728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:14,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617136290] [2025-03-08 04:36:14,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:14,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:14,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:14,682 INFO L229 MonitoredProcess]: Starting monitored process 5 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:36:14,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:36:14,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-08 04:36:15,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 04:36:15,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:36:15,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:15,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 189 conjuncts are in the unsatisfiable core [2025-03-08 04:36:15,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:15,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 04:36:15,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:36:15,304 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:36:15,305 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:36:15,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 04:36:15,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:36:15,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:36:15,473 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 04:36:15,473 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 69 treesize of output 43 [2025-03-08 04:36:15,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 04:36:15,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11