./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 798a7b37 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-?-798a7b3-m [2025-03-03 13:24:31,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:24:31,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:24:31,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:24:31,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:24:31,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:24:31,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:24:31,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:24:31,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:24:31,832 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:24:31,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:24:31,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:24:31,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:24:31,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:24:31,833 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:24:31,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:24:31,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:24:31,833 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:24:31,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:24:31,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:24:31,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:24:31,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:24:31,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:24:31,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:24:31,834 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:24:31,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:24:31,834 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:24:31,834 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:24:31,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:24:31,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:24:31,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:24:31,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:24:31,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:24:31,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:24:31,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:24:31,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:24:31,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:24:31,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:24:31,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:24:31,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:24:31,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:24:31,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:24:31,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:24:31,836 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-03 13:24:32,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:24:32,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:24:32,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:24:32,058 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:24:32,058 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:24:32,060 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-03 13:24:33,151 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf885576/6e5db78486ce4a47b50e0e7a2d94e6ba/FLAG3940f0e0c [2025-03-03 13:24:33,424 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:24:33,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2025-03-03 13:24:33,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf885576/6e5db78486ce4a47b50e0e7a2d94e6ba/FLAG3940f0e0c [2025-03-03 13:24:33,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf885576/6e5db78486ce4a47b50e0e7a2d94e6ba [2025-03-03 13:24:33,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:24:33,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:24:33,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:24:33,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:24:33,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:24:33,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:24:33" (1/1) ... [2025-03-03 13:24:33,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f744f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:33, skipping insertion in model container [2025-03-03 13:24:33,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:24:33" (1/1) ... [2025-03-03 13:24:33,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:24:33,941 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-03 13:24:33,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:24:33,950 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:24:33,986 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-03 13:24:33,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:24:34,010 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:24:34,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34 WrapperNode [2025-03-03 13:24:34,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:24:34,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:24:34,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:24:34,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:24:34,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,043 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2025-03-03 13:24:34,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:24:34,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:24:34,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:24:34,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:24:34,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,067 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-03 13:24:34,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:24:34,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:24:34,080 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:24:34,081 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:24:34,081 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (1/1) ... [2025-03-03 13:24:34,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:24:34,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:24:34,103 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-03 13:24:34,104 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-03 13:24:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:24:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:24:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-03 13:24:34,121 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:24:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 13:24:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:24:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 13:24:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 13:24:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 13:24:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:24:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:24:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:24:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:24:34,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:24:34,220 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:24:34,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:24:34,357 INFO L1325 $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-03 13:24:34,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-03 13:24:34,384 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-03 13:24:34,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:24:34,390 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:24:34,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:24:34,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:24:34 BoogieIcfgContainer [2025-03-03 13:24:34,391 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:24:34,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:24:34,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:24:34,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:24:34,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:24:33" (1/3) ... [2025-03-03 13:24:34,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514c104f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:24:34, skipping insertion in model container [2025-03-03 13:24:34,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:24:34" (2/3) ... [2025-03-03 13:24:34,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514c104f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:24:34, skipping insertion in model container [2025-03-03 13:24:34,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:24:34" (3/3) ... [2025-03-03 13:24:34,399 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2025-03-03 13:24:34,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:24:34,410 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-03 13:24:34,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:24:34,448 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;@72b34d0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:24:34,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:24:34,452 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-03 13:24:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:24:34,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:24:34,456 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-03 13:24:34,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:24:34,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:24:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1999437092, now seen corresponding path program 1 times [2025-03-03 13:24:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:24:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702425230] [2025-03-03 13:24:34,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:24:34,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:24:34,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:24:34,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:34,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:34,811 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-03 13:24:34,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:24:34,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702425230] [2025-03-03 13:24:34,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702425230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:24:34,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:24:34,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:24:34,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397198389] [2025-03-03 13:24:34,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:24:34,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:24:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:24:34,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:24:34,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:24:34,833 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-03 13:24:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:24:34,859 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2025-03-03 13:24:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:24:34,862 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-03 13:24:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:24:34,867 INFO L225 Difference]: With dead ends: 70 [2025-03-03 13:24:34,867 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 13:24:34,869 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-03 13:24:34,872 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-03 13:24:34,874 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-03 13:24:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 13:24:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-03 13:24:34,894 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-03 13:24:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-03 13:24:34,900 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 24 [2025-03-03 13:24:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:24:34,900 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-03 13:24:34,901 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-03 13:24:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-03 13:24:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:24:34,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:24:34,902 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-03 13:24:34,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:24:34,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:24:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:24:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash 846332882, now seen corresponding path program 1 times [2025-03-03 13:24:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:24:34,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949187287] [2025-03-03 13:24:34,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:24:34,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:24:34,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:24:34,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:34,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:35,314 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-03 13:24:35,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:24:35,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949187287] [2025-03-03 13:24:35,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949187287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:24:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589508508] [2025-03-03 13:24:35,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:35,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:35,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:24:35,335 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-03 13:24:35,336 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-03 13:24:35,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:24:35,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:24:35,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:35,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:35,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 13:24:35,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:24:35,602 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-03 13:24:35,615 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-03 13:24:35,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:24:35,677 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-03 13:24:35,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589508508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:24:35,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:24:35,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-03-03 13:24:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773664319] [2025-03-03 13:24:35,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:24:35,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:24:35,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:24:35,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:24:35,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:24:35,684 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-03 13:24:39,707 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-03 13:24:43,727 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-03 13:24:47,741 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-03 13:24:51,858 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-03 13:24:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:24:51,861 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2025-03-03 13:24:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:24:51,861 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-03 13:24:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:24:51,862 INFO L225 Difference]: With dead ends: 49 [2025-03-03 13:24:51,862 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 13:24:51,862 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-03 13:24:51,862 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-03 13:24:51,862 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-03 13:24:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 13:24:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-03 13:24:51,867 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-03 13:24:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-03 13:24:51,868 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 33 [2025-03-03 13:24:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:24:51,868 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-03 13:24:51,868 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-03 13:24:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-03 13:24:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:24:51,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:24:51,869 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-03 13:24:51,876 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-03 13:24:52,073 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-03 13:24:52,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:24:52,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:24:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 888535511, now seen corresponding path program 1 times [2025-03-03 13:24:52,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:24:52,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655504213] [2025-03-03 13:24:52,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:24:52,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:24:52,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:24:52,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:52,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:52,926 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-03 13:24:52,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:24:52,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655504213] [2025-03-03 13:24:52,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655504213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:24:52,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399170270] [2025-03-03 13:24:52,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:24:52,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:24:52,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:24:52,929 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-03 13:24:52,930 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-03 13:24:53,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:24:53,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:24:53,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:24:53,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:24:53,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-03 13:24:53,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:24:53,081 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-03 13:24:53,236 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:24:53,236 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-03 13:24:53,282 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-03 13:24:53,337 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-03 13:24:53,337 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-03 13:24:53,424 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-03 13:24:53,432 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-03 13:24:53,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:24:53,636 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-03 13:24:53,649 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-03 13:24:53,649 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-03 13:24:54,068 INFO L349 Elim1Store]: treesize reduction 98, result has 36.8 percent of original size [2025-03-03 13:24:54,068 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-03 13:24:54,097 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2025-03-03 13:24:54,098 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-03 13:24:54,108 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-03 13:24:54,123 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-03 13:24:54,155 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-03 13:24:54,172 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-03 13:24:54,226 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-03 13:25:18,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:25:18,804 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-03 13:25:18,893 INFO L349 Elim1Store]: treesize reduction 12, result has 90.1 percent of original size [2025-03-03 13:25:18,893 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-03 13:25:18,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:25:18,928 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-03 13:25:18,943 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-03 13:25:19,746 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-03 13:25:19,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:25:19,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:25:19,851 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-03 13:25:19,855 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-03 13:25:19,902 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-03 13:25:19,911 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-03 13:25:19,917 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-03 13:25:19,925 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-03 13:25:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399170270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:20,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:25:20,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 36 [2025-03-03 13:25:20,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258996420] [2025-03-03 13:25:20,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:25:20,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 13:25:20,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:25:20,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 13:25:20,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1827, Unknown=6, NotChecked=0, Total=1980 [2025-03-03 13:25:20,652 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-03 13:25:24,851 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-03 13:25:41,179 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-03 13:25:53,334 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-03 13:25:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:25:53,639 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2025-03-03 13:25:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 13:25:53,640 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-03 13:25:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:25:53,641 INFO L225 Difference]: With dead ends: 82 [2025-03-03 13:25:53,642 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 13:25:53,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=265, Invalid=3030, Unknown=11, NotChecked=0, Total=3306 [2025-03-03 13:25:53,643 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 57 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:25:53,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 499 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 708 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2025-03-03 13:25:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 13:25:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2025-03-03 13:25:53,653 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-03 13:25:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-03 13:25:53,654 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 36 [2025-03-03 13:25:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:25:53,654 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-03 13:25:53,654 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-03 13:25:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-03 13:25:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:25:53,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:25:53,655 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-03 13:25:53,665 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-03 13:25:53,859 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-03 13:25:53,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:25:53,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:25:53,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1713795065, now seen corresponding path program 1 times [2025-03-03 13:25:53,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:25:53,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153402648] [2025-03-03 13:25:53,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:53,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:25:53,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 13:25:53,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:25:53,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:53,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:55,420 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-03 13:25:55,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:25:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153402648] [2025-03-03 13:25:55,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153402648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:25:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91374408] [2025-03-03 13:25:55,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:25:55,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:25:55,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:25:55,422 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-03 13:25:55,424 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-03 13:25:55,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 13:25:55,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 13:25:55,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:25:55,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:25:55,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-03 13:25:55,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:25:55,808 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-03 13:25:55,949 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-03 13:25:56,004 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:25:56,004 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-03 13:25:56,066 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-03 13:25:56,069 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-03 13:25:56,122 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-03 13:25:56,122 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-03 13:25:56,126 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-03 13:25:56,213 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-03 13:25:56,215 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-03 13:25:56,218 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-03 13:25:56,364 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-03 13:25:56,365 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-03 13:25:56,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:25:56,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-03-03 13:25:56,391 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-03 13:25:56,391 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-03 13:25:56,645 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-03 13:25:56,747 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-03 13:25:56,805 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:25:56,805 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-03 13:25:56,866 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-03 13:25:56,869 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-03 13:25:57,004 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-03 13:25:57,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:25:57,131 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-03 13:25:57,343 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| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#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-03 13:26:01,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91374408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:26:01,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:26:01,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 45 [2025-03-03 13:26:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760175718] [2025-03-03 13:26:01,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:26:01,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 13:26:01,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:26:01,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 13:26:01,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2560, Unknown=55, NotChecked=102, Total=2862 [2025-03-03 13:26:01,544 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-03 13:26:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:26:03,810 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2025-03-03 13:26:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 13:26:03,811 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-03 13:26:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:26:03,812 INFO L225 Difference]: With dead ends: 111 [2025-03-03 13:26:03,812 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 13:26:03,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=451, Invalid=6976, Unknown=59, NotChecked=170, Total=7656 [2025-03-03 13:26:03,815 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-03 13:26:03,815 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-03 13:26:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 13:26:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2025-03-03 13:26:03,827 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-03 13:26:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-03-03 13:26:03,828 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 40 [2025-03-03 13:26:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:26:03,829 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-03 13:26:03,829 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-03 13:26:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-03-03 13:26:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 13:26:03,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:26:03,829 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-03 13:26:03,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:26:04,030 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-03 13:26:04,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:26:04,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:26:04,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1230707110, now seen corresponding path program 2 times [2025-03-03 13:26:04,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:26:04,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242768131] [2025-03-03 13:26:04,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:26:04,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:26:04,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-03 13:26:04,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 13:26:04,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:26:04,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:26:07,148 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-03 13:26:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:26:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242768131] [2025-03-03 13:26:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242768131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:26:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238543699] [2025-03-03 13:26:07,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:26:07,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:26:07,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:26:07,151 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-03 13:26:07,151 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-03 13:26:07,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-03 13:26:07,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 13:26:07,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:26:07,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:26:07,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 189 conjuncts are in the unsatisfiable core [2025-03-03 13:26:07,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:26:07,546 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-03 13:26:07,681 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-03 13:26:07,740 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:26:07,740 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-03 13:26:07,804 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-03 13:26:07,814 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-03 13:26:07,821 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-03 13:26:07,893 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-03 13:26:07,893 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-03 13:26:07,900 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-03 13:26:07,906 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-03 13:26:08,034 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-03 13:26:08,034 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2025-03-03 13:26:08,038 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-03 13:26:08,041 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-03 13:26:08,043 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 11 treesize of output 3 [2025-03-03 13:26:08,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:26:08,256 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-03 13:26:08,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2025-03-03 13:26:08,267 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-03 13:26:08,268 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-03 13:26:08,279 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 20 treesize of output 15 [2025-03-03 13:26:08,283 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 20 treesize of output 15 [2025-03-03 13:26:09,117 INFO L349 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2025-03-03 13:26:09,117 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 279 treesize of output 125 [2025-03-03 13:26:09,141 INFO L349 Elim1Store]: treesize reduction 122, result has 10.3 percent of original size [2025-03-03 13:26:09,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 495 treesize of output 220 [2025-03-03 13:26:09,158 INFO L349 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2025-03-03 13:26:09,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 259 treesize of output 179 [2025-03-03 13:26:09,176 INFO L349 Elim1Store]: treesize reduction 100, result has 18.7 percent of original size [2025-03-03 13:26:09,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 250 treesize of output 192 [2025-03-03 13:26:09,180 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 50 [2025-03-03 13:26:09,190 INFO L349 Elim1Store]: treesize reduction 49, result has 35.5 percent of original size [2025-03-03 13:26:09,190 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 1 case distinctions, treesize of input 50 treesize of output 31 [2025-03-03 13:26:09,886 INFO L349 Elim1Store]: treesize reduction 220, result has 29.7 percent of original size [2025-03-03 13:26:09,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 264 treesize of output 216 [2025-03-03 13:26:09,977 INFO L349 Elim1Store]: treesize reduction 164, result has 36.2 percent of original size [2025-03-03 13:26:09,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 133 treesize of output 187 [2025-03-03 13:26:09,987 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 128 treesize of output 92 [2025-03-03 13:26:10,816 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-03 13:26:10,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:26:11,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (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|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_593 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| .cse6 (store (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_591)) (.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_593))) (let ((.cse1 (select (select .cse0 .cse3) .cse5)) (.cse2 (select (select .cse4 .cse3) .cse5))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse3)) (not (= (select (select .cse4 .cse1) .cse2) .cse5)))))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| .cse6 v_ArrVal_589) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_595) .cse3) (+ .cse5 4)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_589 (store (select |c_#memory_int#1| .cse6) .cse7 (select v_ArrVal_589 .cse7)))))))) is different from false [2025-03-03 13:26:12,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238543699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:26:12,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:26:12,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 52 [2025-03-03 13:26:12,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44518242] [2025-03-03 13:26:12,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:26:12,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-03 13:26:12,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:26:12,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-03 13:26:12,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3746, Unknown=52, NotChecked=124, Total=4160 [2025-03-03 13:26:12,393 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 52 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 43 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)