./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_append_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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:10:18,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:10:18,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:10:18,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:10:18,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:10:18,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:10:18,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:10:18,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:10:18,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:10:18,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:10:18,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:10:18,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:10:18,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:10:18,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:10:18,423 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:10:18,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:10:18,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:10:18,425 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:10:18,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:10:18,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:10:18,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:10:18,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:10:18,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:10:18,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:10:18,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:10:18,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:10:18,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:10:18,428 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:10:18,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:10:18,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:10:18,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:10:18,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:10:18,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:10:18,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:10:18,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:10:18,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:10:18,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:10:18,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:10:18,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:10:18,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:10:18,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:10:18,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:10:18,437 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-11-18 13:10:18,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:10:18,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:10:18,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:10:18,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:10:18,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:10:18,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-18 13:10:20,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:10:20,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:10:20,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-18 13:10:20,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54bd7f17/ec7c85a53ed74b1ab365aecc5ba6eab7/FLAGeac461f99 [2024-11-18 13:10:20,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c54bd7f17/ec7c85a53ed74b1ab365aecc5ba6eab7 [2024-11-18 13:10:20,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:10:20,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:10:20,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:10:20,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:10:20,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:10:20,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:20,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@701eb3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20, skipping insertion in model container [2024-11-18 13:10:20,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:20,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:10:20,845 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_append_equal.i[24197,24210] [2024-11-18 13:10:20,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:10:20,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:10:20,900 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_append_equal.i[24197,24210] [2024-11-18 13:10:20,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:10:20,932 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:10:20,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20 WrapperNode [2024-11-18 13:10:20,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:10:20,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:10:20,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:10:20,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:10:20,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:20,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:20,989 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2024-11-18 13:10:20,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:10:20,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:10:20,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:10:20,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:10:21,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:21,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:21,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:21,034 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 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-18 13:10:21,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:21,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:21,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:21,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:21,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:21,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:21,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:10:21,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:10:21,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:10:21,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:10:21,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (1/1) ... [2024-11-18 13:10:21,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:10:21,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:21,091 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-18 13:10:21,093 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-18 13:10:21,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:10:21,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:10:21,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 13:10:21,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:10:21,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:10:21,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 13:10:21,133 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-18 13:10:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-18 13:10:21,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:10:21,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:10:21,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 13:10:21,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:10:21,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:10:21,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 13:10:21,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:10:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:10:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 13:10:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:10:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 13:10:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 13:10:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 13:10:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:10:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:10:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 13:10:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:10:21,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:10:21,269 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:10:21,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:10:21,472 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-18 13:10:21,473 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:10:21,486 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:10:21,489 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 13:10:21,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:10:21 BoogieIcfgContainer [2024-11-18 13:10:21,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:10:21,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:10:21,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:10:21,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:10:21,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:10:20" (1/3) ... [2024-11-18 13:10:21,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bafc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:10:21, skipping insertion in model container [2024-11-18 13:10:21,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:10:20" (2/3) ... [2024-11-18 13:10:21,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bafc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:10:21, skipping insertion in model container [2024-11-18 13:10:21,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:10:21" (3/3) ... [2024-11-18 13:10:21,502 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-11-18 13:10:21,521 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:10:21,521 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:10:21,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:10:21,573 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;@17d024de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:10:21,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:10:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 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-18 13:10:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 13:10:21,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:21,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:10:21,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:21,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2128592868, now seen corresponding path program 1 times [2024-11-18 13:10:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131186361] [2024-11-18 13:10:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:21,836 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-18 13:10:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:21,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131186361] [2024-11-18 13:10:21,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131186361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:10:21,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:10:21,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:10:21,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698920759] [2024-11-18 13:10:21,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:10:21,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:10:21,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:10:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:10:21,876 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 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 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-18 13:10:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:21,895 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-11-18 13:10:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:10:21,898 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 17 [2024-11-18 13:10:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:21,904 INFO L225 Difference]: With dead ends: 56 [2024-11-18 13:10:21,904 INFO L226 Difference]: Without dead ends: 25 [2024-11-18 13:10:21,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:10:21,911 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:21,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:10:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-18 13:10:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-18 13:10:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-18 13:10:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-18 13:10:21,948 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2024-11-18 13:10:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:21,949 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-18 13:10:21,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-18 13:10:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-18 13:10:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 13:10:21,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:21,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:10:21,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:10:21,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:21,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:21,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1341887012, now seen corresponding path program 1 times [2024-11-18 13:10:21,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:21,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572614081] [2024-11-18 13:10:21,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:21,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:22,150 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-18 13:10:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572614081] [2024-11-18 13:10:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572614081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:10:22,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:10:22,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:10:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858819946] [2024-11-18 13:10:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:10:22,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:10:22,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:22,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:10:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:10:22,155 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 13:10:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:22,175 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-11-18 13:10:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:10:22,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-18 13:10:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:22,178 INFO L225 Difference]: With dead ends: 48 [2024-11-18 13:10:22,178 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 13:10:22,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:10:22,181 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:22,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:10:22,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 13:10:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-18 13:10:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-18 13:10:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-18 13:10:22,191 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2024-11-18 13:10:22,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:22,191 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-18 13:10:22,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 13:10:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-18 13:10:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 13:10:22,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:22,193 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, 1] [2024-11-18 13:10:22,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:10:22,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:22,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2097266908, now seen corresponding path program 1 times [2024-11-18 13:10:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:22,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985368079] [2024-11-18 13:10:22,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:22,355 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-18 13:10:22,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:22,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985368079] [2024-11-18 13:10:22,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985368079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:22,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759188298] [2024-11-18 13:10:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:22,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:22,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:22,359 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-18 13:10:22,362 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-18 13:10:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:22,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 13:10:22,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:22,568 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-18 13:10:22,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:22,625 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-18 13:10:22,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759188298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:10:22,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:10:22,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-18 13:10:22,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106474099] [2024-11-18 13:10:22,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:22,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:10:22,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:22,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:10:22,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:10:22,628 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-18 13:10:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:22,654 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2024-11-18 13:10:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:10:22,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-18 13:10:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:22,658 INFO L225 Difference]: With dead ends: 49 [2024-11-18 13:10:22,658 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 13:10:22,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:10:22,659 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:22,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:10:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 13:10:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-18 13:10:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-18 13:10:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-18 13:10:22,666 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2024-11-18 13:10:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:22,667 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-18 13:10:22,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-18 13:10:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-18 13:10:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 13:10:22,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:22,670 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] [2024-11-18 13:10:22,688 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-18 13:10:22,871 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-18 13:10:22,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:22,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash -867054116, now seen corresponding path program 2 times [2024-11-18 13:10:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:22,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719068865] [2024-11-18 13:10:22,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:10:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:22,904 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-18 13:10:22,908 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:10:23,178 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-18 13:10:23,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719068865] [2024-11-18 13:10:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719068865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:10:23,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:10:23,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 13:10:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083628071] [2024-11-18 13:10:23,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:10:23,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 13:10:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 13:10:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-18 13:10:23,181 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-18 13:10:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:23,278 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-18 13:10:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 13:10:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 35 [2024-11-18 13:10:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:23,280 INFO L225 Difference]: With dead ends: 40 [2024-11-18 13:10:23,280 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 13:10:23,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-18 13:10:23,282 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:23,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 167 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:10:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 13:10:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2024-11-18 13:10:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-18 13:10:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-18 13:10:23,289 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 35 [2024-11-18 13:10:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:23,290 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-18 13:10:23,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-18 13:10:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-18 13:10:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 13:10:23,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:23,291 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] [2024-11-18 13:10:23,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 13:10:23,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash -867052442, now seen corresponding path program 1 times [2024-11-18 13:10:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723894208] [2024-11-18 13:10:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:23,841 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-18 13:10:23,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:23,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723894208] [2024-11-18 13:10:23,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723894208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:10:23,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:10:23,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 13:10:23,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194011848] [2024-11-18 13:10:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:10:23,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 13:10:23,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:23,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 13:10:23,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-18 13:10:23,846 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-18 13:10:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:23,996 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-18 13:10:23,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 13:10:23,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 35 [2024-11-18 13:10:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:23,998 INFO L225 Difference]: With dead ends: 40 [2024-11-18 13:10:23,998 INFO L226 Difference]: Without dead ends: 38 [2024-11-18 13:10:23,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-18 13:10:23,999 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:24,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 149 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:10:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-18 13:10:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2024-11-18 13:10:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 13:10:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-18 13:10:24,005 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2024-11-18 13:10:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:24,006 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-18 13:10:24,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-18 13:10:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-18 13:10:24,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 13:10:24,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:24,007 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, 1] [2024-11-18 13:10:24,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 13:10:24,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:24,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash -13708553, now seen corresponding path program 1 times [2024-11-18 13:10:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788524074] [2024-11-18 13:10:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:24,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-18 13:10:24,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:24,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788524074] [2024-11-18 13:10:24,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788524074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:24,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051634241] [2024-11-18 13:10:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:24,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:24,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:24,252 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-18 13:10:24,253 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-18 13:10:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:24,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 13:10:24,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:24,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-18 13:10:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 13:10:24,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-18 13:10:24,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051634241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:10:24,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:10:24,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2024-11-18 13:10:24,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354935934] [2024-11-18 13:10:24,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:24,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 13:10:24,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:24,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 13:10:24,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-18 13:10:24,645 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:10:28,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:10:32,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:10:36,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:10:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:36,800 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-18 13:10:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 13:10:36,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2024-11-18 13:10:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:36,803 INFO L225 Difference]: With dead ends: 43 [2024-11-18 13:10:36,806 INFO L226 Difference]: Without dead ends: 35 [2024-11-18 13:10:36,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-18 13:10:36,807 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:36,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 210 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2024-11-18 13:10:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-18 13:10:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-18 13:10:36,812 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-18 13:10:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-18 13:10:36,813 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 37 [2024-11-18 13:10:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:36,813 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-18 13:10:36,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:10:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-18 13:10:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 13:10:36,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:36,814 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, 1, 1] [2024-11-18 13:10:36,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 13:10:37,015 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-18 13:10:37,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:37,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1386356248, now seen corresponding path program 1 times [2024-11-18 13:10:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:37,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122046245] [2024-11-18 13:10:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 13:10:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:37,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122046245] [2024-11-18 13:10:37,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122046245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:37,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668479855] [2024-11-18 13:10:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:37,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:37,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:37,159 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-18 13:10:37,160 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-18 13:10:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:37,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 13:10:37,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:37,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-18 13:10:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:10:37,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 13:10:37,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668479855] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:10:37,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:10:37,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2024-11-18 13:10:37,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518378257] [2024-11-18 13:10:37,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:37,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 13:10:37,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:37,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 13:10:37,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-18 13:10:37,430 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 13:10:41,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:10:45,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:10:49,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-18 13:10:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:49,567 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-18 13:10:49,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 13:10:49,568 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-18 13:10:49,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:49,569 INFO L225 Difference]: With dead ends: 39 [2024-11-18 13:10:49,569 INFO L226 Difference]: Without dead ends: 36 [2024-11-18 13:10:49,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-18 13:10:49,570 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:49,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 166 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2024-11-18 13:10:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-18 13:10:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-18 13:10:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 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-18 13:10:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-18 13:10:49,580 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 38 [2024-11-18 13:10:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:49,581 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-18 13:10:49,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 13:10:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-18 13:10:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 13:10:49,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:49,585 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, 1, 1] [2024-11-18 13:10:49,606 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-18 13:10:49,786 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-18 13:10:49,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:49,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:49,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1386357922, now seen corresponding path program 1 times [2024-11-18 13:10:49,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:49,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668608297] [2024-11-18 13:10:49,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:49,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:10:50,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668608297] [2024-11-18 13:10:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668608297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14988547] [2024-11-18 13:10:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:50,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:50,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:50,722 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-18 13:10:50,723 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-18 13:10:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:50,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-18 13:10:50,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:50,962 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-18 13:10:50,978 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-18 13:10:51,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-18 13:10:51,231 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-18 13:10:51,236 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-18 13:10:51,357 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_36| Int)) (and (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_36| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_36|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_36|) 0))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2024-11-18 13:10:51,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:51,389 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-18 13:10:51,406 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:10:51,407 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-18 13:10:51,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-18 13:10:51,641 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 19 treesize of output 11 [2024-11-18 13:10:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-11-18 13:10:51,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:51,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14988547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:51,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:51,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-18 13:10:51,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252346162] [2024-11-18 13:10:51,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:51,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-18 13:10:51,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:51,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-18 13:10:51,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=895, Unknown=1, NotChecked=60, Total=1056 [2024-11-18 13:10:51,971 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 30 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 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-18 13:10:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:52,613 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-18 13:10:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 13:10:52,613 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 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 38 [2024-11-18 13:10:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:52,614 INFO L225 Difference]: With dead ends: 49 [2024-11-18 13:10:52,614 INFO L226 Difference]: Without dead ends: 47 [2024-11-18 13:10:52,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=158, Invalid=1567, Unknown=1, NotChecked=80, Total=1806 [2024-11-18 13:10:52,616 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:52,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 193 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 387 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2024-11-18 13:10:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-18 13:10:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-11-18 13:10:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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-18 13:10:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-18 13:10:52,628 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 38 [2024-11-18 13:10:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:52,629 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-18 13:10:52,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 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-18 13:10:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-18 13:10:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 13:10:52,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:52,632 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, 1, 1, 1, 1] [2024-11-18 13:10:52,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 13:10:52,834 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-18 13:10:52,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:52,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash 850134067, now seen corresponding path program 1 times [2024-11-18 13:10:52,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:52,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742721185] [2024-11-18 13:10:52,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:52,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 13:10:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742721185] [2024-11-18 13:10:53,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742721185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050601508] [2024-11-18 13:10:53,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:53,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:53,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:53,674 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-18 13:10:53,675 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-18 13:10:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:53,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-18 13:10:53,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:53,847 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-18 13:10:53,919 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 19 treesize of output 1 [2024-11-18 13:10:54,011 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 18 treesize of output 4 [2024-11-18 13:10:54,014 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-18 13:10:54,028 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_45| Int)) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_45| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_45|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_45|) 0))) is different from true [2024-11-18 13:10:54,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:54,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-18 13:10:54,052 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:10:54,052 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-18 13:10:54,153 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2024-11-18 13:10:54,153 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 47 treesize of output 42 [2024-11-18 13:10:54,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-18 13:10:54,164 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 22 treesize of output 14 [2024-11-18 13:10:54,192 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 20 treesize of output 8 [2024-11-18 13:10:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-18 13:10:54,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050601508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:54,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 31 [2024-11-18 13:10:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646868712] [2024-11-18 13:10:54,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:54,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-18 13:10:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-18 13:10:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=969, Unknown=2, NotChecked=62, Total=1122 [2024-11-18 13:10:54,504 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:10:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:55,026 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-11-18 13:10:55,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 13:10:55,027 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 40 [2024-11-18 13:10:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:55,029 INFO L225 Difference]: With dead ends: 52 [2024-11-18 13:10:55,029 INFO L226 Difference]: Without dead ends: 43 [2024-11-18 13:10:55,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=1587, Unknown=2, NotChecked=80, Total=1806 [2024-11-18 13:10:55,031 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:55,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 324 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 493 Invalid, 0 Unknown, 42 Unchecked, 0.3s Time] [2024-11-18 13:10:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-18 13:10:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-18 13:10:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-18 13:10:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-18 13:10:55,038 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 40 [2024-11-18 13:10:55,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:55,039 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-18 13:10:55,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:10:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-18 13:10:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 13:10:55,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:55,040 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, 1, 1, 1, 1] [2024-11-18 13:10:55,058 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-18 13:10:55,244 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-18 13:10:55,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:55,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash 403581565, now seen corresponding path program 1 times [2024-11-18 13:10:55,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:55,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852447841] [2024-11-18 13:10:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:55,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:10:56,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:56,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852447841] [2024-11-18 13:10:56,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852447841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:56,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182713712] [2024-11-18 13:10:56,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:56,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:56,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:56,449 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-18 13:10:56,450 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-18 13:10:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:10:56,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-18 13:10:56,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:56,849 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-18 13:10:56,891 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-18 13:10:56,999 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-18 13:10:57,010 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-18 13:10:57,217 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-18 13:10:57,221 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-18 13:10:57,225 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-18 13:10:57,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-18 13:10:57,349 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_53| Int)) (let ((.cse0 (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_53|))) (and (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_53| .cse0) |c_#memory_int#2|) (= (select .cse0 0) |c_node_create_#in~data#1|) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_53| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_53|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_53|) 0))))) is different from true [2024-11-18 13:10:57,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:57,399 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-18 13:10:57,413 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:10:57,414 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-18 13:10:57,421 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-18 13:10:57,712 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-18 13:10:57,716 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-18 13:10:57,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-18 13:10:57,921 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-18 13:10:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-18 13:10:57,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:10:58,155 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 43 treesize of output 31 [2024-11-18 13:10:58,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:10:58,365 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 54 treesize of output 55 [2024-11-18 13:10:58,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182713712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:58,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:10:58,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2024-11-18 13:10:58,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333468240] [2024-11-18 13:10:58,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:10:58,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-18 13:10:58,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:10:58,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-18 13:10:58,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2020, Unknown=1, NotChecked=90, Total=2256 [2024-11-18 13:10:58,436 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 36 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:10:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:59,527 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-18 13:10:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-18 13:10:59,527 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 36 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-18 13:10:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:59,532 INFO L225 Difference]: With dead ends: 55 [2024-11-18 13:10:59,532 INFO L226 Difference]: Without dead ends: 53 [2024-11-18 13:10:59,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=268, Invalid=3641, Unknown=1, NotChecked=122, Total=4032 [2024-11-18 13:10:59,534 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:59,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 366 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 676 Invalid, 0 Unknown, 54 Unchecked, 0.5s Time] [2024-11-18 13:10:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-18 13:10:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2024-11-18 13:10:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 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-18 13:10:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-18 13:10:59,547 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 40 [2024-11-18 13:10:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:59,548 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-18 13:10:59,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 36 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:10:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-18 13:10:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 13:10:59,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:59,549 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, 1, 1, 1, 1] [2024-11-18 13:10:59,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-18 13:10:59,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:59,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1294861784, now seen corresponding path program 1 times [2024-11-18 13:10:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200055527] [2024-11-18 13:10:59,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:10:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:11:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:11:01,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:11:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200055527] [2024-11-18 13:11:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200055527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:11:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23937030] [2024-11-18 13:11:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:11:01,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:11:01,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:11:01,995 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:11:01,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 13:11:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:11:02,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 129 conjuncts are in the unsatisfiable core [2024-11-18 13:11:02,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:11:02,212 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-18 13:11:02,225 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-18 13:11:02,285 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-18 13:11:06,428 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse1 (select |c_#memory_int#2| .cse1)) |c_#memory_int#2|) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|))))) (= |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-18 13:11:06,430 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse1 (select |c_#memory_int#2| .cse1)) |c_#memory_int#2|) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|))))) (= |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-18 13:11:06,456 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-18 13:11:06,489 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:11:06,489 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-18 13:11:06,498 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 15 treesize of output 1 [2024-11-18 13:11:10,501 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (exists ((|v_#memory_int#2_135| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_135|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| .cse1) 0) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) (= |v_#memory_int#2_135| (store |v_#memory_int#2_BEFORE_CALL_6| .cse2 (select |v_#memory_int#2_135| .cse2)))))) (= (store |v_#memory_int#2_135| |c_ULTIMATE.start_sll_create_~head~0#1.base| (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_#memory_int#2|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-18 13:11:10,504 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1) (exists ((|v_#memory_int#2_135| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_135|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| .cse1) 0) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) (= |v_#memory_int#2_135| (store |v_#memory_int#2_BEFORE_CALL_6| .cse2 (select |v_#memory_int#2_135| .cse2)))))) (= (store |v_#memory_int#2_135| |c_ULTIMATE.start_sll_create_~head~0#1.base| (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_#memory_int#2|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-18 13:11:10,541 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-18 13:11:10,543 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-18 13:11:10,590 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))))))) is different from false [2024-11-18 13:11:10,592 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))))))) is different from true [2024-11-18 13:11:10,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-18 13:11:10,623 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 .cse0) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-18 13:11:10,637 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-18 13:11:10,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-18 13:11:10,645 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-18 13:11:10,663 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_37) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-18 13:11:10,665 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_37) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-18 13:11:10,694 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_37) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |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_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-18 13:11:10,695 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_37) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |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_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-18 13:11:10,752 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_37) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (exists ((|v_node_create_~temp~0#1.base_62| Int)) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_62|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_62|)) |c_#memory_int#2|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_62|)) |c_#memory_$Pointer$#2.offset|)))) is different from false [2024-11-18 13:11:10,755 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_37) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (exists ((|v_node_create_~temp~0#1.base_62| Int)) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_62|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_62|)) |c_#memory_int#2|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_62|)) |c_#memory_$Pointer$#2.offset|)))) is different from true [2024-11-18 13:11:10,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:11:10,832 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-18 13:11:10,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:11:10,842 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 40 treesize of output 35 [2024-11-18 13:11:10,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:11:10,855 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-18 13:11:10,892 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-18 13:11:10,895 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-18 13:11:11,037 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-18 13:11:11,040 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-18 13:11:11,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-18 13:11:11,182 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-18 13:11:11,341 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-18 13:11:11,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 87 [2024-11-18 13:11:11,368 INFO L349 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2024-11-18 13:11:11,368 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 36 treesize of output 31 [2024-11-18 13:11:11,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:11:11,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 35 [2024-11-18 13:11:11,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (let ((.cse2 (= .cse3 .cse4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0)) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_20| .cse5))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-11-18 13:11:11,402 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (let ((.cse2 (= .cse3 .cse4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0)) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_20| .cse5))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-11-18 13:11:11,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:11:11,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 75 [2024-11-18 13:11:11,463 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-18 13:11:11,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-18 13:11:11,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse1) 0) 1) .cse0) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0)))))) is different from false [2024-11-18 13:11:11,477 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse1) 0) 1) .cse0) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0)))))) is different from true [2024-11-18 13:11:11,491 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 23 treesize of output 15 [2024-11-18 13:11:11,498 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 47 treesize of output 27 [2024-11-18 13:11:11,529 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2024-11-18 13:11:11,531 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2024-11-18 13:11:11,557 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2024-11-18 13:11:11,560 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2024-11-18 13:11:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2024-11-18 13:11:11,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:11:11,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_955 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) v_ArrVal_955)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_954) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_956) .cse0) .cse1))))) is different from false [2024-11-18 13:11:11,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_30| Int) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_955 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_30| (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| .cse2 (store (select |c_#memory_int#2| .cse2) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_30| 4) v_ArrVal_955)) (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_954) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_956) .cse3) .cse4))))))) is different from false [2024-11-18 13:11:12,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23937030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:11:12,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:11:12,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 46 [2024-11-18 13:11:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451081837] [2024-11-18 13:11:12,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:11:12,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-18 13:11:12,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:11:12,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-18 13:11:12,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1152, Unknown=48, NotChecked=1428, Total=2756 [2024-11-18 13:11:12,066 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 46 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 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-18 13:11:12,393 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |c_#memory_int#2| .cse3)) |c_#memory_int#2|) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |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-18 13:11:12,396 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |c_#memory_int#2| .cse3)) |c_#memory_int#2|) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |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-18 13:11:16,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse4 (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (select (select |c_#memory_int#2| .cse3) 0)) (.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse4) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse3) 1) (or .cse4 (= .cse1 1) (exists ((|v_#memory_int#2_135| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_135|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| .cse3) 0) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse5) (= |v_#memory_int#2_135| (store |v_#memory_int#2_BEFORE_CALL_6| .cse5 (select |v_#memory_int#2_135| .cse5)))))) (= (store |v_#memory_int#2_135| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) |c_#memory_int#2|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-18 13:11:16,402 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse4 (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse1 (select (select |c_#memory_int#2| .cse3) 0)) (.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse4) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse3) 1) (or .cse4 (= .cse1 1) (exists ((|v_#memory_int#2_135| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_135|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| .cse3) 0) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse5) (= |v_#memory_int#2_135| (store |v_#memory_int#2_BEFORE_CALL_6| .cse5 (select |v_#memory_int#2_135| .cse5)))))) (= (store |v_#memory_int#2_135| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) |c_#memory_int#2|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-18 13:11:16,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse2) 0))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse3 (= .cse0 1)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-18 13:11:16,407 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse2) 0))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse3 (= .cse0 1)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-18 13:11:16,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse3 (= .cse0 1)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-18 13:11:16,413 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (or .cse3 (= .cse0 1)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-18 13:11:16,417 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))) (let ((.cse1 (select (select |c_#memory_int#2| .cse0) 0)) (.cse2 (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 1) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |c_#valid| .cse3)))))) (not .cse2)))) is different from false [2024-11-18 13:11:16,419 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))) (let ((.cse1 (select (select |c_#memory_int#2| .cse0) 0)) (.cse2 (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 1) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |c_#valid| .cse3)))))) (not .cse2)))) is different from true [2024-11-18 13:11:16,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse0 (select .cse2 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (or (= .cse3 .cse0) (= (select (select |c_#memory_int#2| .cse3) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) 0)))))) is different from false [2024-11-18 13:11:16,426 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse0 (select .cse2 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (or (= .cse3 .cse0) (= (select (select |c_#memory_int#2| .cse3) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) 0)))))) is different from true [2024-11-18 13:11:16,431 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_37) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-18 13:11:16,433 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_37) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-18 13:11:16,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse6 (select |c_#memory_int#2| .cse6)))) (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_37) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_#valid_BEFORE_CALL_9| .cse4))) |v_#valid_BEFORE_CALL_9|)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)) (exists ((|v_node_create_~temp~0#1.base_62| Int)) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_62|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_62|)) |c_#memory_int#2|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_62|)) |c_#memory_$Pointer$#2.offset|))))))) is different from false [2024-11-18 13:11:16,446 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse6 (select |c_#memory_int#2| .cse6)))) (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 0)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_37) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_#valid_BEFORE_CALL_9| .cse4))) |v_#valid_BEFORE_CALL_9|)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)) (exists ((|v_node_create_~temp~0#1.base_62| Int)) (and (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_62|))) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_62|)) |c_#memory_int#2|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_62|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_62| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_62|)) |c_#memory_$Pointer$#2.offset|))))))) is different from true [2024-11-18 13:11:16,459 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (select .cse3 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse4 .cse5) (= (select (select |c_#memory_int#2| .cse4) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse7 (select |v_old(#valid)_AFTER_CALL_20| .cse7))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) 0)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-18 13:11:16,463 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (select .cse3 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse4 .cse5) (= (select (select |c_#memory_int#2| .cse4) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse7 (select |v_old(#valid)_AFTER_CALL_20| .cse7))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) 0)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-18 13:11:16,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (select .cse3 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse4 .cse5) (= (select (select |c_#memory_int#2| .cse4) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse7 (select |v_old(#valid)_AFTER_CALL_20| .cse7))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) 0)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-18 13:11:16,478 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (select .cse3 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse4 .cse5) (= (select (select |c_#memory_int#2| .cse4) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse7 (select |v_old(#valid)_AFTER_CALL_20| .cse7))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse2) 0)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-18 13:11:16,493 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse2 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse3 .cse4) (= (select (select |c_#memory_int#2| .cse3) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse5) 0)) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_20| .cse6))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-18 13:11:16,498 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse2 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse3 .cse4) (= (select (select |c_#memory_int#2| .cse3) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse5) 0)) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_20| .cse6))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-18 13:11:16,507 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse2 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse3 .cse4) (= (select (select |c_#memory_int#2| .cse3) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse5) 0)) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_20| .cse6))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-18 13:11:16,510 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse2 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (or (= .cse3 .cse4) (= (select (select |c_#memory_int#2| .cse3) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse5) 0)) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_20| .cse6))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-18 13:11:16,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 0)) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_20| .cse5))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (not (= (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) 0)) (= (select .cse6 0) 0) (not (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-11-18 13:11:16,522 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= .cse2 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 0)) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |v_old(#valid)_AFTER_CALL_20| .cse5))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (not (= (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) 0)) (= (select .cse6 0) 0) (not (= .cse4 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-11-18 13:11:16,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (= .cse3 .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0)) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_20| .cse6))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-11-18 13:11:16,536 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (= .cse3 .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_37 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_37) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_21| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1))) |v_#valid_BEFORE_CALL_9|)))) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse4) 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0)) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |v_old(#valid)_AFTER_CALL_20| .cse6))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_20| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-11-18 13:11:16,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)) (.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse2 (select (select |c_#memory_int#2| .cse4) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 1) .cse1) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0)))))) is different from false [2024-11-18 13:11:16,550 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4)) (.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0)) (.cse2 (select (select |c_#memory_int#2| .cse4) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 1) .cse1) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0)))))) is different from true [2024-11-18 13:11:16,563 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|) 0))) (and (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= .cse1 |c_ULTIMATE.start_main_~data~0#1|) (= .cse1 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2024-11-18 13:11:16,565 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~temp~2#1.base|) 0))) (and (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= .cse1 |c_ULTIMATE.start_main_~data~0#1|) (= .cse1 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2024-11-18 13:11:16,580 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select .cse0 0) 1))) is different from false [2024-11-18 13:11:16,582 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_62| Int) (|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_21| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_21|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |v_node_create_~temp~0#1.base_62|) 0))) (= (select .cse0 0) 1))) is different from true [2024-11-18 13:11:16,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |c_#memory_int#2| .cse3)) |c_#memory_int#2|) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|))))) (= |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-18 13:11:16,644 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and .cse0 (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (or .cse0 (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |c_#memory_int#2| .cse3)) |c_#memory_int#2|) (= .cse3 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|))))) (= |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-18 13:11:16,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse2) 1) (or .cse3 (= .cse0 1) (exists ((|v_#memory_int#2_135| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_135|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| .cse2) 0) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4) (= |v_#memory_int#2_135| (store |v_#memory_int#2_BEFORE_CALL_6| .cse4 (select |v_#memory_int#2_135| .cse4)))))) (= (store |v_#memory_int#2_135| |c_ULTIMATE.start_sll_create_~head~0#1.base| (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_#memory_int#2|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2024-11-18 13:11:16,651 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse3 (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse2) 1) (or .cse3 (= .cse0 1) (exists ((|v_#memory_int#2_135| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_135|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| .cse2) 0) 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4) (= |v_#memory_int#2_135| (store |v_#memory_int#2_BEFORE_CALL_6| .cse4 (select |v_#memory_int#2_135| .cse4)))))) (= (store |v_#memory_int#2_135| |c_ULTIMATE.start_sll_create_~head~0#1.base| (select |c_#memory_int#2| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_#memory_int#2|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from true [2024-11-18 13:11:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:11:16,717 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2024-11-18 13:11:16,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-18 13:11:16,718 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 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 42 [2024-11-18 13:11:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:11:16,719 INFO L225 Difference]: With dead ends: 76 [2024-11-18 13:11:16,719 INFO L226 Difference]: Without dead ends: 74 [2024-11-18 13:11:16,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=188, Invalid=1429, Unknown=87, NotChecked=3996, Total=5700 [2024-11-18 13:11:16,721 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 2179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1798 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:11:16,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 405 Invalid, 2179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 371 Invalid, 0 Unknown, 1798 Unchecked, 0.3s Time] [2024-11-18 13:11:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-18 13:11:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-18 13:11:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:11:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2024-11-18 13:11:16,737 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 42 [2024-11-18 13:11:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:11:16,738 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2024-11-18 13:11:16,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 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-18 13:11:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2024-11-18 13:11:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 13:11:16,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:11:16,739 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, 1, 1, 1, 1] [2024-11-18 13:11:16,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 13:11:16,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:11:16,940 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:11:16,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:11:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash 848307608, now seen corresponding path program 2 times [2024-11-18 13:11:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:11:16,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542916904] [2024-11-18 13:11:16,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:11:16,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:11:16,982 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:11:16,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:11:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:11:18,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:11:18,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542916904] [2024-11-18 13:11:18,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542916904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:11:18,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755794760] [2024-11-18 13:11:18,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:11:18,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:11:18,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:11:18,887 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:11:18,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 13:11:19,039 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:11:19,039 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:11:19,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-18 13:11:19,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:11:19,098 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-18 13:11:19,149 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-18 13:11:19,229 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-18 13:11:19,303 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:11:19,303 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 16 treesize of output 15 [2024-11-18 13:11:19,321 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:11:19,321 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-18 13:11:19,378 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-18 13:11:19,386 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 22 [2024-11-18 13:11:19,393 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-18 13:11:19,651 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-18 13:11:19,657 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-18 13:11:19,662 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-18 13:11:19,665 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-18 13:11:19,785 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_71| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_71|) 0) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_71| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_71|)) |c_#memory_int#2|) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_71| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_71|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_71| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_71|)) |c_#memory_$Pointer$#2.base|)))) is different from true [2024-11-18 13:11:19,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:11:19,819 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-18 13:11:19,838 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:11:19,839 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-18 13:11:19,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-18 13:11:19,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-18 13:11:20,116 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 43 treesize of output 19 [2024-11-18 13:11:20,230 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-18 13:11:20,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-18 13:11:20,346 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 19 treesize of output 11 [2024-11-18 13:11:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-18 13:11:20,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:11:20,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755794760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:11:20,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:11:20,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 44 [2024-11-18 13:11:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564769283] [2024-11-18 13:11:20,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:11:20,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-18 13:11:20,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:11:20,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-18 13:11:20,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2072, Unknown=1, NotChecked=92, Total=2352 [2024-11-18 13:11:20,891 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:11:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:11:21,754 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-11-18 13:11:21,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-18 13:11:21,757 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2024-11-18 13:11:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:11:21,758 INFO L225 Difference]: With dead ends: 88 [2024-11-18 13:11:21,758 INFO L226 Difference]: Without dead ends: 86 [2024-11-18 13:11:21,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=283, Invalid=3142, Unknown=1, NotChecked=114, Total=3540 [2024-11-18 13:11:21,760 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 13:11:21,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 307 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 711 Invalid, 0 Unknown, 59 Unchecked, 0.4s Time] [2024-11-18 13:11:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-18 13:11:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2024-11-18 13:11:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 66 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:11:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2024-11-18 13:11:21,784 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 42 [2024-11-18 13:11:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:11:21,784 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-11-18 13:11:21,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:11:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2024-11-18 13:11:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 13:11:21,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:11:21,785 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:11:21,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 13:11:21,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-18 13:11:21,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:11:21,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:11:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1178308631, now seen corresponding path program 1 times [2024-11-18 13:11:21,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:11:21,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305555356] [2024-11-18 13:11:21,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:11:21,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:11:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:11:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:11:23,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:11:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305555356] [2024-11-18 13:11:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305555356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:11:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867348907] [2024-11-18 13:11:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:11:23,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:11:23,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:11:23,637 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:11:23,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 13:11:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:11:23,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-11-18 13:11:23,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:11:23,897 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-18 13:11:24,064 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:11:24,065 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-18 13:11:24,126 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-18 13:11:24,136 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-18 13:11:24,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-18 13:11:24,299 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-18 13:11:24,302 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-18 13:11:24,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:11:24,495 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 38 treesize of output 27 [2024-11-18 13:11:24,514 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:11:24,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-18 13:11:24,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-18 13:11:25,028 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-18 13:11:25,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 73 [2024-11-18 13:11:25,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:11:25,039 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 39 treesize of output 30 [2024-11-18 13:11:25,133 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 94 treesize of output 62 [2024-11-18 13:11:25,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:11:25,194 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-18 13:11:25,314 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:11:25,314 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 52 treesize of output 23 [2024-11-18 13:11:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:11:25,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:11:25,828 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| Int) (v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1233 (Array Int Int))) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|) 0)) (not (= (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_1233)) (.cse3 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37| v_ArrVal_1234)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select .cse3 .cse7) .cse8)) (.cse5 (+ (select (select .cse6 .cse7) .cse8) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_37|)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store .cse6 .cse4 (store (select .cse6 .cse4) .cse5 0)) .cse1) .cse2) 4)))) 0)))) is different from false [2024-11-18 13:11:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867348907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:11:25,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:11:25,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 47 [2024-11-18 13:11:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001070954] [2024-11-18 13:11:25,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:11:25,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-18 13:11:25,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:11:25,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-18 13:11:25,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2709, Unknown=1, NotChecked=104, Total=2970 [2024-11-18 13:11:25,833 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 47 states, 45 states have (on average 1.488888888888889) internal successors, (67), 38 states have internal predecessors, (67), 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-18 13:11:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:11:26,981 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-18 13:11:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-18 13:11:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.488888888888889) internal successors, (67), 38 states have internal predecessors, (67), 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 44 [2024-11-18 13:11:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:11:26,984 INFO L225 Difference]: With dead ends: 93 [2024-11-18 13:11:26,984 INFO L226 Difference]: Without dead ends: 90 [2024-11-18 13:11:26,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=248, Invalid=4177, Unknown=1, NotChecked=130, Total=4556 [2024-11-18 13:11:26,986 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 13:11:26,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 582 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 13:11:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-18 13:11:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-11-18 13:11:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 68 states have internal predecessors, (78), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:11:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2024-11-18 13:11:27,014 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 44 [2024-11-18 13:11:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:11:27,014 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2024-11-18 13:11:27,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.488888888888889) internal successors, (67), 38 states have internal predecessors, (67), 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-18 13:11:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2024-11-18 13:11:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 13:11:27,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:11:27,016 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:11:27,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-18 13:11:27,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-18 13:11:27,217 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:11:27,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:11:27,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1178306957, now seen corresponding path program 2 times [2024-11-18 13:11:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:11:27,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657406169] [2024-11-18 13:11:27,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:11:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:11:27,248 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:11:27,249 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:11:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:11:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:11:29,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657406169] [2024-11-18 13:11:29,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657406169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:11:29,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394319732] [2024-11-18 13:11:29,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:11:29,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:11:29,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:11:29,247 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:11:29,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 13:11:29,408 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:11:29,408 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:11:29,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-11-18 13:11:29,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:11:29,451 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-18 13:11:29,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:11:29,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:11:29,764 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:11:29,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:11:29,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-18 13:11:29,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-18 13:11:29,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 33 treesize of output 17 [2024-11-18 13:11:29,846 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 27 treesize of output 26 [2024-11-18 13:11:30,124 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-18 13:11:30,124 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 102 treesize of output 31 [2024-11-18 13:11:30,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-18 13:11:30,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-18 13:11:30,162 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-18 13:11:30,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:11:30,248 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-18 13:11:30,249 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 110 treesize of output 87 [2024-11-18 13:11:30,275 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-18 13:11:30,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-18 13:11:30,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2024-11-18 13:11:30,827 INFO L349 Elim1Store]: treesize reduction 130, result has 20.2 percent of original size [2024-11-18 13:11:30,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 71 [2024-11-18 13:11:30,863 INFO L349 Elim1Store]: treesize reduction 158, result has 24.8 percent of original size [2024-11-18 13:11:30,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 70 [2024-11-18 13:11:30,881 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-18 13:11:30,881 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 1 case distinctions, treesize of input 22 treesize of output 27 [2024-11-18 13:11:31,104 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 367 treesize of output 299 [2024-11-18 13:11:31,110 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 303 treesize of output 251 [2024-11-18 13:11:32,407 INFO L349 Elim1Store]: treesize reduction 60, result has 85.3 percent of original size [2024-11-18 13:11:32,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 377 treesize of output 532 [2024-11-18 13:11:33,171 INFO L349 Elim1Store]: treesize reduction 96, result has 86.5 percent of original size [2024-11-18 13:11:33,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 179 treesize of output 733