./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/sll2n_prepend_equal.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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:59:42,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:59:42,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:59:42,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:59:42,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:59:42,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:59:42,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:59:42,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:59:42,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:59:42,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:59:42,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:59:42,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:59:42,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:59:42,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:59:42,249 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:59:42,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:59:42,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:59:42,250 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:59:42,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:59:42,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:59:42,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:59:42,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:59:42,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:59:42,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:59:42,254 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:59:42,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:59:42,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:59:42,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:59:42,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:59:42,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:59:42,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:59:42,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:59:42,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:59:42,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:59:42,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:59:42,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:59:42,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:59:42,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:59:42,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:59:42,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:59:42,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:59:42,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:59:42,260 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2024-11-08 13:59:42,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:59:42,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:59:42,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:59:42,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:59:42,556 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:59:42,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-08 13:59:43,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:59:44,261 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:59:44,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-08 13:59:44,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6688ef7/c7b0fa06590140f1ad0a21765b9b797c/FLAGd717bde23 [2024-11-08 13:59:44,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6688ef7/c7b0fa06590140f1ad0a21765b9b797c [2024-11-08 13:59:44,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:59:44,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:59:44,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:59:44,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:59:44,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:59:44,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1e97d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44, skipping insertion in model container [2024-11-08 13:59:44,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:59:44,689 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/sll2n_prepend_equal.i[24076,24089] [2024-11-08 13:59:44,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:59:44,708 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:59:44,747 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/sll2n_prepend_equal.i[24076,24089] [2024-11-08 13:59:44,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:59:44,790 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:59:44,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44 WrapperNode [2024-11-08 13:59:44,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:59:44,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:59:44,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:59:44,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:59:44,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,837 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2024-11-08 13:59:44,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:59:44,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:59:44,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:59:44,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:59:44,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,876 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-08 13:59:44,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:59:44,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:59:44,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:59:44,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:59:44,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (1/1) ... [2024-11-08 13:59:44,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:59:44,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:44,925 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) [2024-11-08 13:59:44,927 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 [2024-11-08 13:59:44,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:59:44,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:59:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:59:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:59:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:59:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:59:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 13:59:44,973 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 13:59:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:59:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:59:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:59:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:59:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:59:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:59:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:59:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:59:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:59:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:59:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:59:44,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:59:44,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:59:44,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:59:44,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:59:44,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:59:44,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:59:44,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:59:45,093 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:59:45,110 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:59:45,295 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-08 13:59:45,296 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:59:45,306 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:59:45,307 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 13:59:45,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:59:45 BoogieIcfgContainer [2024-11-08 13:59:45,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:59:45,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:59:45,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:59:45,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:59:45,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:59:44" (1/3) ... [2024-11-08 13:59:45,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a43dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:59:45, skipping insertion in model container [2024-11-08 13:59:45,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:44" (2/3) ... [2024-11-08 13:59:45,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a43dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:59:45, skipping insertion in model container [2024-11-08 13:59:45,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:59:45" (3/3) ... [2024-11-08 13:59:45,316 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2024-11-08 13:59:45,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:59:45,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:59:45,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:59:45,386 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;@4129e3f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:59:45,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:59:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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) [2024-11-08 13:59:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 13:59:45,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:45,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:45,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:45,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash 845524335, now seen corresponding path program 1 times [2024-11-08 13:59:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:45,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225117950] [2024-11-08 13:59:45,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:59:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:59:45,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225117950] [2024-11-08 13:59:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225117950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:45,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:45,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:59:45,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351266953] [2024-11-08 13:59:45,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:45,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:59:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:45,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:59:45,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:59:45,791 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:59:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:45,844 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2024-11-08 13:59:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:59:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-08 13:59:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:45,854 INFO L225 Difference]: With dead ends: 48 [2024-11-08 13:59:45,855 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 13:59:45,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:59:45,863 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:45,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 13:59:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-08 13:59:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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) [2024-11-08 13:59:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-08 13:59:45,899 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2024-11-08 13:59:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:45,900 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-08 13:59:45,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:59:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-08 13:59:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 13:59:45,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:45,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:45,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:59:45,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:45,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash 595026039, now seen corresponding path program 1 times [2024-11-08 13:59:45,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:45,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188886577] [2024-11-08 13:59:45,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:45,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:46,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:59:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:59:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188886577] [2024-11-08 13:59:46,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188886577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:46,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:46,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:59:46,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987223258] [2024-11-08 13:59:46,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:46,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:59:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:46,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:59:46,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:59:46,108 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:59:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:46,148 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-08 13:59:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:59:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-08 13:59:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:46,150 INFO L225 Difference]: With dead ends: 40 [2024-11-08 13:59:46,150 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 13:59:46,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:59:46,151 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:46,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 52 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 13:59:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-08 13:59:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2024-11-08 13:59:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-08 13:59:46,160 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2024-11-08 13:59:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:46,161 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-08 13:59:46,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:59:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-08 13:59:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:59:46,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:46,162 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:46,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:59:46,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:46,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -190501289, now seen corresponding path program 1 times [2024-11-08 13:59:46,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:46,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487198526] [2024-11-08 13:59:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:46,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 13:59:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:59:46,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:46,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487198526] [2024-11-08 13:59:46,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487198526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379836674] [2024-11-08 13:59:46,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:46,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:46,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:46,419 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) [2024-11-08 13:59:46,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:59:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:46,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 13:59:46,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:59:46,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:59:46,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379836674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:59:46,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:59:46,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-08 13:59:46,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193612642] [2024-11-08 13:59:46,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:59:46,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:59:46,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:46,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:59:46,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:59:46,714 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 13:59:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:46,758 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-08 13:59:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:59:46,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-08 13:59:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:46,761 INFO L225 Difference]: With dead ends: 41 [2024-11-08 13:59:46,761 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 13:59:46,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:59:46,762 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:46,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 13:59:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-08 13:59:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2024-11-08 13:59:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-08 13:59:46,772 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 25 [2024-11-08 13:59:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:46,772 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-08 13:59:46,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 13:59:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-08 13:59:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:59:46,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:46,774 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:46,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:59:46,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:46,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:46,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:46,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1242497929, now seen corresponding path program 2 times [2024-11-08 13:59:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:46,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490678744] [2024-11-08 13:59:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:46,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:47,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:47,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:59:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:47,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:59:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 13:59:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490678744] [2024-11-08 13:59:47,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490678744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:47,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:47,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 13:59:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520473054] [2024-11-08 13:59:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:47,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 13:59:47,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 13:59:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:59:47,779 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:59:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:47,951 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-08 13:59:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 13:59:47,952 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-08 13:59:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:47,953 INFO L225 Difference]: With dead ends: 32 [2024-11-08 13:59:47,953 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 13:59:47,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-08 13:59:47,954 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:47,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:59:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 13:59:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-08 13:59:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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) [2024-11-08 13:59:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-08 13:59:47,960 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 34 [2024-11-08 13:59:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:47,961 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-08 13:59:47,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:59:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-08 13:59:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:59:47,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:47,962 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:47,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:59:47,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:47,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:47,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1242499603, now seen corresponding path program 1 times [2024-11-08 13:59:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:47,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163359681] [2024-11-08 13:59:47,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:47,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:48,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:48,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:59:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:59:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 13:59:48,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:48,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163359681] [2024-11-08 13:59:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163359681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:48,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:48,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 13:59:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856511521] [2024-11-08 13:59:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:48,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 13:59:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:48,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 13:59:48,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:59:48,282 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:59:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:48,357 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-08 13:59:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 13:59:48,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-08 13:59:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:48,362 INFO L225 Difference]: With dead ends: 31 [2024-11-08 13:59:48,362 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 13:59:48,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:59:48,363 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:48,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 121 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:59:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 13:59:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 13:59:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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) [2024-11-08 13:59:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-08 13:59:48,368 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2024-11-08 13:59:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:48,369 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-08 13:59:48,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:59:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-08 13:59:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 13:59:48,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:48,370 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:48,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:59:48,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:48,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash -39567630, now seen corresponding path program 1 times [2024-11-08 13:59:48,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:48,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599775503] [2024-11-08 13:59:48,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:48,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:49,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:59:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:49,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:59:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:59:49,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:49,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599775503] [2024-11-08 13:59:49,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599775503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:49,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071793277] [2024-11-08 13:59:49,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:49,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:49,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:49,703 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) [2024-11-08 13:59:49,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:59:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:49,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-08 13:59:49,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:49,963 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 [2024-11-08 13:59:49,985 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 [2024-11-08 13:59:50,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 13:59:50,253 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 [2024-11-08 13:59:50,259 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 3 [2024-11-08 13:59:50,499 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 13:59:50,500 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 [2024-11-08 13:59:50,537 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 13:59:50,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 13:59:50,639 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 23 treesize of output 15 [2024-11-08 13:59:50,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-08 13:59:50,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2024-11-08 13:59:50,671 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 13:59:50,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 13:59:50,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 19 treesize of output 11 [2024-11-08 13:59:50,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-08 13:59:50,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 13:59:50,841 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 7 treesize of output 3 [2024-11-08 13:59:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:59:50,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:51,094 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 208 treesize of output 178 [2024-11-08 13:59:51,099 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 314 treesize of output 254 [2024-11-08 13:59:51,236 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse3 (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse0 (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse4 (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (and (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_554 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554) v_arrayElimCell_14))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 v_arrayElimCell_15))))) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554) v_arrayElimCell_14) v_arrayElimCell_15))))) (.cse5 (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_554 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse2) .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 v_arrayElimCell_14) v_arrayElimCell_15))))))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_554 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554) .cse2) .cse3))) (not .cse0) (not .cse4)) (or .cse4 .cse1) (or .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (or .cse5 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (forall ((v_ArrVal_554 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_554))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 .cse2) .cse3)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int)) (let ((.cse7 (select .cse6 v_arrayElimCell_14))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 v_arrayElimCell_15)))))))))))) is different from false [2024-11-08 13:59:51,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071793277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:51,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:59:51,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2024-11-08 13:59:51,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909378996] [2024-11-08 13:59:51,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:59:51,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 13:59:51,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:51,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 13:59:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1171, Unknown=1, NotChecked=68, Total=1332 [2024-11-08 13:59:51,726 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 13:59:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:52,567 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-08 13:59:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 13:59:52,568 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2024-11-08 13:59:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:52,569 INFO L225 Difference]: With dead ends: 39 [2024-11-08 13:59:52,569 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 13:59:52,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=164, Invalid=2095, Unknown=1, NotChecked=92, Total=2352 [2024-11-08 13:59:52,570 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:52,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 243 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 13:59:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 13:59:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-08 13:59:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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) [2024-11-08 13:59:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-08 13:59:52,584 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 36 [2024-11-08 13:59:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:52,585 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-08 13:59:52,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 13:59:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-08 13:59:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 13:59:52,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:52,587 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:52,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 13:59:52,791 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,SelfDestructingSolverStorable5 [2024-11-08 13:59:52,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:52,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash -39569304, now seen corresponding path program 1 times [2024-11-08 13:59:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:52,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475055793] [2024-11-08 13:59:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:52,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:53,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:59:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:53,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:59:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:59:53,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:53,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475055793] [2024-11-08 13:59:53,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475055793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:53,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662559858] [2024-11-08 13:59:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:53,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:53,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:53,329 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) [2024-11-08 13:59:53,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 13:59:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:53,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-08 13:59:53,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:53,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:59:53,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 13:59:53,708 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 12 treesize of output 4 [2024-11-08 13:59:53,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2024-11-08 13:59:53,894 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 13:59:53,894 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 13:59:53,912 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 21 treesize of output 16 [2024-11-08 13:59:53,995 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 36 treesize of output 31 [2024-11-08 13:59:54,056 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-08 13:59:54,057 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 71 treesize of output 82 [2024-11-08 13:59:54,093 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-08 13:59:54,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 13:59:54,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:54,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 186 treesize of output 278 [2024-11-08 13:59:54,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:54,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 126 treesize of output 258 [2024-11-08 14:00:04,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:04,933 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 43 treesize of output 34 [2024-11-08 14:00:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:00:04,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:06,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:06,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2024-11-08 14:00:06,064 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~head#1.offset| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (or (not (= (select .cse0 |ULTIMATE.start_sll_prepend_~head#1.offset|) (select v_arrayElimArr_1 4))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18| v_arrayElimArr_1) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |ULTIMATE.start_sll_prepend_~head#1.offset| 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_18|) 0))))) is different from false [2024-11-08 14:00:06,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662559858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:06,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:06,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 28 [2024-11-08 14:00:06,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598920386] [2024-11-08 14:00:06,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:06,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 14:00:06,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:06,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 14:00:06,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=850, Unknown=1, NotChecked=58, Total=992 [2024-11-08 14:00:06,069 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 28 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 22 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 14:00:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:06,707 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-08 14:00:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 14:00:06,708 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 22 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2024-11-08 14:00:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:06,710 INFO L225 Difference]: With dead ends: 39 [2024-11-08 14:00:06,710 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 14:00:06,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=1352, Unknown=1, NotChecked=74, Total=1560 [2024-11-08 14:00:06,712 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:06,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 361 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 14:00:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 14:00:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-08 14:00:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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) [2024-11-08 14:00:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-08 14:00:06,731 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 36 [2024-11-08 14:00:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:06,731 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-08 14:00:06,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 22 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 14:00:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-08 14:00:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 14:00:06,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:06,732 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:06,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 14:00:06,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:06,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:06,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash 630247085, now seen corresponding path program 2 times [2024-11-08 14:00:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:06,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471619163] [2024-11-08 14:00:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:06,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:08,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:09,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:09,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471619163] [2024-11-08 14:00:09,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471619163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:09,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145251199] [2024-11-08 14:00:09,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:00:09,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:09,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:09,339 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) [2024-11-08 14:00:09,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 14:00:09,508 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:00:09,508 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:09,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 151 conjuncts are in the unsatisfiable core [2024-11-08 14:00:09,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:09,583 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 [2024-11-08 14:00:09,597 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 [2024-11-08 14:00:09,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 14:00:10,009 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 14:00:10,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 14:00:10,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 14:00:10,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 14:00:10,117 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 [2024-11-08 14:00:10,135 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 15 treesize of output 1 [2024-11-08 14:00:10,383 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 45 treesize of output 21 [2024-11-08 14:00:10,388 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 [2024-11-08 14:00:10,393 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 [2024-11-08 14:00:10,398 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 7 treesize of output 3 [2024-11-08 14:00:10,638 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 14:00:10,638 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 [2024-11-08 14:00:10,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:10,658 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 53 treesize of output 36 [2024-11-08 14:00:10,678 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-08 14:00:10,678 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 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-08 14:00:10,709 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 14:00:10,709 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 [2024-11-08 14:00:10,814 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 71 treesize of output 50 [2024-11-08 14:00:10,819 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 31 treesize of output 26 [2024-11-08 14:00:10,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 58 [2024-11-08 14:00:10,837 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 36 treesize of output 23 [2024-11-08 14:00:10,865 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 14:00:10,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 14:00:10,975 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 65 [2024-11-08 14:00:11,256 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 14:00:11,257 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 66 treesize of output 33 [2024-11-08 14:00:11,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 14:00:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:11,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:11,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:11,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 192 [2024-11-08 14:00:11,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:11,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 171 [2024-11-08 14:00:16,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145251199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:16,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:16,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2024-11-08 14:00:16,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055303681] [2024-11-08 14:00:16,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:16,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-08 14:00:16,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:16,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-08 14:00:16,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2607, Unknown=6, NotChecked=0, Total=2756 [2024-11-08 14:00:16,109 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 45 states, 43 states have (on average 1.372093023255814) internal successors, (59), 36 states have internal predecessors, (59), 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) [2024-11-08 14:00:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:17,669 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-11-08 14:00:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 14:00:17,669 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.372093023255814) internal successors, (59), 36 states have internal predecessors, (59), 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) Word has length 38 [2024-11-08 14:00:17,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:17,670 INFO L225 Difference]: With dead ends: 43 [2024-11-08 14:00:17,670 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 14:00:17,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=286, Invalid=4678, Unknown=6, NotChecked=0, Total=4970 [2024-11-08 14:00:17,673 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:17,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 317 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 14:00:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 14:00:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-08 14:00:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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) [2024-11-08 14:00:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-08 14:00:17,681 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 38 [2024-11-08 14:00:17,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:17,681 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-08 14:00:17,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.372093023255814) internal successors, (59), 36 states have internal predecessors, (59), 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) [2024-11-08 14:00:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-08 14:00:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 14:00:17,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:17,682 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:17,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 14:00:17,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:17,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:17,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:17,887 INFO L85 PathProgramCache]: Analyzing trace with hash 630245411, now seen corresponding path program 2 times [2024-11-08 14:00:17,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:17,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161972497] [2024-11-08 14:00:17,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:17,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:18,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:18,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:18,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:19,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161972497] [2024-11-08 14:00:19,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161972497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221588090] [2024-11-08 14:00:19,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:00:19,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:19,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:19,074 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:00:19,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 14:00:19,249 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:00:19,250 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:19,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-08 14:00:19,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:19,361 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 [2024-11-08 14:00:19,417 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 15 treesize of output 1 [2024-11-08 14:00:19,571 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 4 [2024-11-08 14:00:19,573 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 3 [2024-11-08 14:00:19,711 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 14:00:19,711 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 21 treesize of output 24 [2024-11-08 14:00:19,726 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 14:00:19,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 14:00:19,794 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-08 14:00:19,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2024-11-08 14:00:19,798 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 42 treesize of output 37 [2024-11-08 14:00:19,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 34 [2024-11-08 14:00:19,808 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 25 treesize of output 17 [2024-11-08 14:00:19,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 49 [2024-11-08 14:00:19,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2024-11-08 14:00:19,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 14:00:20,012 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 14:00:20,012 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 38 treesize of output 15 [2024-11-08 14:00:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:00:20,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:20,171 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 236 treesize of output 206 [2024-11-08 14:00:20,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:20,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 311 [2024-11-08 14:00:20,491 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-08 14:00:20,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-11-08 14:00:20,509 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-08 14:00:20,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-11-08 14:00:20,641 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-08 14:00:20,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 8 [2024-11-08 14:00:21,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221588090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:21,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:21,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 37 [2024-11-08 14:00:21,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573322541] [2024-11-08 14:00:21,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:21,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-08 14:00:21,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:21,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-08 14:00:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1690, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 14:00:21,122 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 29 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:00:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:22,200 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-08 14:00:22,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 14:00:22,200 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 29 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-11-08 14:00:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:22,201 INFO L225 Difference]: With dead ends: 41 [2024-11-08 14:00:22,201 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 14:00:22,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=207, Invalid=2873, Unknown=0, NotChecked=0, Total=3080 [2024-11-08 14:00:22,202 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:22,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 463 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 14:00:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 14:00:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-08 14:00:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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) [2024-11-08 14:00:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-08 14:00:22,211 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 38 [2024-11-08 14:00:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:22,212 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-08 14:00:22,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 29 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:00:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-08 14:00:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 14:00:22,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:22,212 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:22,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 14:00:22,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:22,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:22,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash 77093800, now seen corresponding path program 3 times [2024-11-08 14:00:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:22,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377201651] [2024-11-08 14:00:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:22,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:23,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377201651] [2024-11-08 14:00:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377201651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480095407] [2024-11-08 14:00:24,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:00:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:24,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:24,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:00:24,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 14:00:24,748 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 14:00:24,748 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:24,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 143 conjuncts are in the unsatisfiable core [2024-11-08 14:00:24,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:24,767 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 [2024-11-08 14:00:24,793 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 [2024-11-08 14:00:24,800 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 [2024-11-08 14:00:29,009 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse0))))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-11-08 14:00:29,013 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse0))))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2))) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-11-08 14:00:29,050 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-08 14:00:29,050 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 23 treesize of output 22 [2024-11-08 14:00:29,094 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-08 14:00:29,094 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 27 treesize of output 23 [2024-11-08 14:00:33,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_62| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |v_#memory_$Pointer$#2.base_62|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse1 (select |v_#memory_$Pointer$#2.base_62| .cse1)) |v_#memory_$Pointer$#2.base_62|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse0) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))))) (or (exists ((|v_#memory_$Pointer$#2.offset_53| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_53|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= |v_#memory_$Pointer$#2.offset_53| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |v_#memory_$Pointer$#2.offset_53| .cse2)))))) (= (store |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-08 14:00:33,108 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_62| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.base_62| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 .cse0)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| |v_#memory_$Pointer$#2.base_62|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse1 (select |v_#memory_$Pointer$#2.base_62| .cse1)) |v_#memory_$Pointer$#2.base_62|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_8| .cse0) 4) 0) (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))))) (or (exists ((|v_#memory_$Pointer$#2.offset_53| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_53|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= |v_#memory_$Pointer$#2.offset_53| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |v_#memory_$Pointer$#2.offset_53| .cse2)))))) (= (store |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_53| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-08 14:00:33,151 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-08 14:00:33,153 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-08 14:00:33,192 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))))) (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from false [2024-11-08 14:00:33,194 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))))) (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0))) is different from true [2024-11-08 14:00:33,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-08 14:00:33,234 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |c_#valid|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 .cse2) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-08 14:00:33,250 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 14:00:33,251 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 60 treesize of output 27 [2024-11-08 14:00:33,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:33,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-08 14:00:33,276 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-08 14:00:33,278 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-08 14:00:33,300 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-08 14:00:33,302 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-08 14:00:33,347 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-08 14:00:33,349 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse0))))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-08 14:00:33,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:33,433 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 14:00:33,433 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 68 treesize of output 51 [2024-11-08 14:00:33,514 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-08 14:00:33,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2024-11-08 14:00:33,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (or (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse1))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (= .cse0 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-11-08 14:00:33,564 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (or (= .cse0 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse1))))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (= .cse0 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-11-08 14:00:33,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:33,632 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-08 14:00:33,633 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 99 treesize of output 68 [2024-11-08 14:00:33,730 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-08 14:00:33,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 125 [2024-11-08 14:00:33,767 INFO L349 Elim1Store]: treesize reduction 72, result has 57.9 percent of original size [2024-11-08 14:00:33,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 152 [2024-11-08 14:00:33,827 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 14:00:33,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 14:00:34,462 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_17| .cse1)) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= .cse5 .cse1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse5))))) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse7))))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8))) |v_#valid_BEFORE_CALL_13|))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_#valid_BEFORE_CALL_13| .cse9) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse9))))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse10 (select |v_#valid_BEFORE_CALL_13| .cse10))) |v_#valid_BEFORE_CALL_13|)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-08 14:00:34,466 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_17| .cse1)) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_15| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_15| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= .cse5 .cse1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse5))))) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse7))))) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse8 (select |v_#valid_BEFORE_CALL_13| .cse8))) |v_#valid_BEFORE_CALL_13|))))) (exists ((v_arrayElimIndex_4 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_4) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_#valid_BEFORE_CALL_13| .cse9) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= 0 (select |v_#valid_BEFORE_CALL_12| .cse9))))) (= (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse10 (select |v_#valid_BEFORE_CALL_13| .cse10))) |v_#valid_BEFORE_CALL_13|)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-08 14:00:34,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:34,582 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 345 treesize of output 333 [2024-11-08 14:00:34,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:34,652 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 165 treesize of output 221