./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:13:17,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:13:17,361 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:13:17,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:13:17,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:13:17,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:13:17,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:13:17,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:13:17,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:13:17,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:13:17,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:13:17,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:13:17,436 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:13:17,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:13:17,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:13:17,438 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:13:17,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:13:17,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:13:17,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:13:17,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:13:17,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:13:17,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:13:17,448 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:13:17,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:13:17,449 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:13:17,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:13:17,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:13:17,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:13:17,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:13:17,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:13:17,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:13:17,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:13:17,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:13:17,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:13:17,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:13:17,454 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:13:17,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:13:17,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:13:17,455 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:13:17,455 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2023-11-06 22:13:17,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:13:17,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:13:17,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:13:17,836 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:13:17,837 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:13:17,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2023-11-06 22:13:20,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:13:21,223 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:13:21,224 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2023-11-06 22:13:21,243 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/data/f6eed6543/cc942e882840471ab1a673b5c0d1e136/FLAG111bb5fd0 [2023-11-06 22:13:21,262 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/data/f6eed6543/cc942e882840471ab1a673b5c0d1e136 [2023-11-06 22:13:21,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:13:21,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:13:21,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:13:21,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:13:21,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:13:21,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2929305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21, skipping insertion in model container [2023-11-06 22:13:21,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,336 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:13:21,627 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2023-11-06 22:13:21,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:13:21,670 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:13:21,709 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2023-11-06 22:13:21,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:13:21,762 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:13:21,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21 WrapperNode [2023-11-06 22:13:21,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:13:21,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:13:21,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:13:21,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:13:21,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,823 INFO L138 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 206 [2023-11-06 22:13:21,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:13:21,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:13:21,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:13:21,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:13:21,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:13:21,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:13:21,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:13:21,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:13:21,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (1/1) ... [2023-11-06 22:13:21,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:13:21,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:21,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:13:22,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:13:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-06 22:13:22,048 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-06 22:13:22,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:13:22,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:13:22,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:13:22,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:13:22,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:13:22,051 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2023-11-06 22:13:22,051 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2023-11-06 22:13:22,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:13:22,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:13:22,053 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2023-11-06 22:13:22,053 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2023-11-06 22:13:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:13:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2023-11-06 22:13:22,055 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2023-11-06 22:13:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:13:22,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:13:22,217 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:13:22,219 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:13:22,697 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:13:22,705 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:13:22,705 INFO L302 CfgBuilder]: Removed 33 assume(true) statements. [2023-11-06 22:13:22,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:22 BoogieIcfgContainer [2023-11-06 22:13:22,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:13:22,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:13:22,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:13:22,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:13:22,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:13:21" (1/3) ... [2023-11-06 22:13:22,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6becf703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:13:22, skipping insertion in model container [2023-11-06 22:13:22,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:21" (2/3) ... [2023-11-06 22:13:22,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6becf703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:13:22, skipping insertion in model container [2023-11-06 22:13:22,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:13:22" (3/3) ... [2023-11-06 22:13:22,718 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2023-11-06 22:13:22,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:13:22,740 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:13:22,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:13:22,807 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@74770519, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:13:22,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:13:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 83 states have internal predecessors, (127), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:13:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:13:22,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:22,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:22,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:22,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1662217851, now seen corresponding path program 1 times [2023-11-06 22:13:22,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:22,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064560221] [2023-11-06 22:13:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:13:23,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:23,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064560221] [2023-11-06 22:13:23,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064560221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:23,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:23,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:13:23,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745888430] [2023-11-06 22:13:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:23,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:13:23,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:23,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:13:23,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:13:23,171 INFO L87 Difference]: Start difference. First operand has 97 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 83 states have internal predecessors, (127), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:13:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:23,210 INFO L93 Difference]: Finished difference Result 189 states and 327 transitions. [2023-11-06 22:13:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:13:23,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:13:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:23,222 INFO L225 Difference]: With dead ends: 189 [2023-11-06 22:13:23,222 INFO L226 Difference]: Without dead ends: 88 [2023-11-06 22:13:23,228 INFO L412 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 [2023-11-06 22:13:23,232 INFO L413 NwaCegarLoop]: 115 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, 115 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 [2023-11-06 22:13:23,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:13:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-06 22:13:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-06 22:13:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 75 states have internal predecessors, (83), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:13:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2023-11-06 22:13:23,285 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 16 [2023-11-06 22:13:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:23,285 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2023-11-06 22:13:23,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:13:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2023-11-06 22:13:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 22:13:23,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:23,289 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:23,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:13:23,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:23,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1479543075, now seen corresponding path program 1 times [2023-11-06 22:13:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:23,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370425128] [2023-11-06 22:13:23,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:25,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:13:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:13:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:13:25,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:25,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370425128] [2023-11-06 22:13:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370425128] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948797059] [2023-11-06 22:13:25,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:25,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:25,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:25,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:26,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:13:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:26,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-06 22:13:26,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:26,540 INFO L322 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-11-06 22:13:26,541 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2023-11-06 22:13:26,552 INFO L351 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 12 treesize of output 11 [2023-11-06 22:13:26,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:26,603 INFO L351 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 12 treesize of output 1 [2023-11-06 22:13:26,620 INFO L351 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 55 treesize of output 26 [2023-11-06 22:13:26,844 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:13:26,844 INFO L351 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 24 treesize of output 19 [2023-11-06 22:13:26,916 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:13:26,917 INFO L351 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 20 treesize of output 8 [2023-11-06 22:13:27,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:27,248 INFO L322 Elim1Store]: treesize reduction 93, result has 35.9 percent of original size [2023-11-06 22:13:27,248 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 134 [2023-11-06 22:13:27,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-06 22:13:27,309 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:27,310 INFO L351 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 12 treesize of output 1 [2023-11-06 22:13:27,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:27,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2023-11-06 22:13:27,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:27,404 INFO L322 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-06 22:13:27,405 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 53 [2023-11-06 22:13:28,250 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:28,251 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 179 [2023-11-06 22:13:28,280 INFO L351 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 7 treesize of output 5 [2023-11-06 22:13:28,414 INFO L351 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 20 treesize of output 14 [2023-11-06 22:13:28,513 INFO L351 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 12 treesize of output 8 [2023-11-06 22:13:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:13:28,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:13:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948797059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:28,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:13:28,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [16] total 24 [2023-11-06 22:13:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065309519] [2023-11-06 22:13:28,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:28,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:13:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:28,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:13:28,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:13:28,526 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:13:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:29,928 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2023-11-06 22:13:29,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:13:29,933 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2023-11-06 22:13:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:29,936 INFO L225 Difference]: With dead ends: 110 [2023-11-06 22:13:29,936 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:13:29,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2023-11-06 22:13:29,939 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 84 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:29,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 570 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 809 Invalid, 2 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:13:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:13:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2023-11-06 22:13:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 86 states have internal predecessors, (97), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:13:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2023-11-06 22:13:29,984 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 40 [2023-11-06 22:13:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:29,985 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2023-11-06 22:13:29,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:13:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2023-11-06 22:13:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:13:29,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:29,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:30,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:13:30,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:30,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:30,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash -213924313, now seen corresponding path program 1 times [2023-11-06 22:13:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:30,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54871764] [2023-11-06 22:13:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:13:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:13:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:13:32,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:32,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54871764] [2023-11-06 22:13:32,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54871764] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757356739] [2023-11-06 22:13:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:32,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:32,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:32,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:32,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:13:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:32,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-06 22:13:32,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:32,286 INFO L351 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 39 treesize of output 37 [2023-11-06 22:13:32,397 INFO L322 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-11-06 22:13:32,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2023-11-06 22:13:32,407 INFO L351 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 12 treesize of output 11 [2023-11-06 22:13:32,419 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:32,420 INFO L351 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 12 treesize of output 1 [2023-11-06 22:13:32,443 INFO L351 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 55 treesize of output 26 [2023-11-06 22:13:32,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-06 22:13:32,678 INFO L351 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 20 treesize of output 8 [2023-11-06 22:13:32,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:32,967 INFO L322 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-11-06 22:13:32,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 127 [2023-11-06 22:13:32,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-06 22:13:32,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:32,999 INFO L351 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 12 treesize of output 1 [2023-11-06 22:13:33,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:33,069 INFO L351 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 41 treesize of output 21 [2023-11-06 22:13:33,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-06 22:13:33,099 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sll_~#list~0#1.base|) 0))) (and (= |c_ULTIMATE.start_create_sll_~pp1#1.offset| 0) (= |c_ULTIMATE.start_main_~#p2~0#1.offset| 0) (= |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#p2~0#1.base| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#p2~0#1.base|) (let ((.cse0 (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0)))) (or (and .cse0 (exists ((v_DerPreprocessor_9 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_9) |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store .cse1 0 .cse2)) .cse2))))) (and .cse0 (= .cse2 |c_ULTIMATE.start_create_sll_~#list~0#1.base|)))) (not (= .cse2 0)) (<= (+ .cse2 1) |c_#StackHeapBarrier|))) is different from true [2023-11-06 22:13:33,308 INFO L322 Elim1Store]: treesize reduction 65, result has 42.5 percent of original size [2023-11-06 22:13:33,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 101 treesize of output 120 [2023-11-06 22:13:33,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2023-11-06 22:13:33,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-06 22:13:33,540 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:33,541 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 85 [2023-11-06 22:13:33,567 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-06 22:13:34,864 INFO L322 Elim1Store]: treesize reduction 602, result has 10.4 percent of original size [2023-11-06 22:13:34,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 24 case distinctions, treesize of input 182 treesize of output 401 [2023-11-06 22:13:35,625 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:35,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:35,691 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:35,692 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:35,792 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:35,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:35,856 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:35,857 INFO L351 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 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:36,429 INFO L322 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2023-11-06 22:13:36,430 INFO L351 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 16 [2023-11-06 22:13:36,474 INFO L322 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2023-11-06 22:13:36,475 INFO L351 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 16 [2023-11-06 22:13:36,510 INFO L322 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2023-11-06 22:13:36,511 INFO L351 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 16 [2023-11-06 22:13:36,632 INFO L322 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2023-11-06 22:13:36,632 INFO L351 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 16 [2023-11-06 22:13:36,825 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:36,825 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:36,853 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:36,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:36,898 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:36,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:36,915 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:36,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:37,072 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:37,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:37,095 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:37,095 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:37,134 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:37,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:37,158 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-06 22:13:37,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2023-11-06 22:13:37,364 INFO L351 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 142 treesize of output 132 [2023-11-06 22:13:37,538 INFO L351 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 [2023-11-06 22:13:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:13:37,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757356739] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:37,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:13:37,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 29 [2023-11-06 22:13:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265058889] [2023-11-06 22:13:37,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:37,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 22:13:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:37,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 22:13:37,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=714, Unknown=2, NotChecked=54, Total=870 [2023-11-06 22:13:37,761 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 29 states, 23 states have (on average 2.260869565217391) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:13:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:39,796 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2023-11-06 22:13:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:13:39,797 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 23 states have (on average 2.260869565217391) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-11-06 22:13:39,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:39,800 INFO L225 Difference]: With dead ends: 134 [2023-11-06 22:13:39,800 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 22:13:39,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=207, Invalid=1434, Unknown=3, NotChecked=78, Total=1722 [2023-11-06 22:13:39,802 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 165 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:39,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 632 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1308 Invalid, 3 Unknown, 159 Unchecked, 1.5s Time] [2023-11-06 22:13:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 22:13:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2023-11-06 22:13:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 86 states have internal predecessors, (96), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:13:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2023-11-06 22:13:39,834 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 42 [2023-11-06 22:13:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:39,834 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2023-11-06 22:13:39,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 23 states have (on average 2.260869565217391) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:13:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2023-11-06 22:13:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:13:39,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:39,837 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:39,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:13:40,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:40,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:40,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1620354733, now seen corresponding path program 1 times [2023-11-06 22:13:40,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:40,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935259754] [2023-11-06 22:13:40,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:40,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:42,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:13:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:43,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:13:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:13:46,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:46,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935259754] [2023-11-06 22:13:46,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935259754] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:46,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920022113] [2023-11-06 22:13:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:46,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:46,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:46,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:46,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:13:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:46,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 131 conjunts are in the unsatisfiable core [2023-11-06 22:13:46,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:46,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-11-06 22:13:46,727 INFO L322 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-11-06 22:13:46,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2023-11-06 22:13:46,735 INFO L351 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 12 treesize of output 11 [2023-11-06 22:13:46,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:13:46,771 INFO L351 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 12 treesize of output 1 [2023-11-06 22:13:46,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:46,799 INFO L351 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 55 treesize of output 26 [2023-11-06 22:13:47,052 INFO L351 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 17 treesize of output 12 [2023-11-06 22:13:47,134 INFO L351 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 8 treesize of output 4 [2023-11-06 22:13:47,200 INFO L351 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 [2023-11-06 22:13:47,450 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 50 [2023-11-06 22:13:47,478 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:13:47,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2023-11-06 22:13:47,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2023-11-06 22:13:47,511 INFO L351 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 20 treesize of output 19 [2023-11-06 22:13:47,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:47,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:47,838 INFO L351 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 38 treesize of output 33 [2023-11-06 22:13:47,845 INFO L351 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 14 treesize of output 13 [2023-11-06 22:13:47,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-11-06 22:13:48,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:48,145 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-11-06 22:13:48,161 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-06 22:13:48,161 INFO L351 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 54 treesize of output 43 [2023-11-06 22:13:48,184 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-06 22:13:48,195 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-06 22:13:48,331 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-06 22:13:48,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 25 [2023-11-06 22:13:48,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:13:48,346 INFO L351 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 15 treesize of output 7 [2023-11-06 22:13:48,632 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-06 22:13:48,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 21 [2023-11-06 22:13:49,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:49,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:49,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:49,051 INFO L351 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 31 treesize of output 24 [2023-11-06 22:13:49,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:49,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:13:49,084 INFO L322 Elim1Store]: treesize reduction 51, result has 8.9 percent of original size [2023-11-06 22:13:49,084 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 56 [2023-11-06 22:13:49,095 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-06 22:13:49,114 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:13:49,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:13:49,121 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:13:49,384 INFO L351 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 15 treesize of output 7 [2023-11-06 22:13:49,836 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:13:49,837 INFO L351 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 41 treesize of output 20 [2023-11-06 22:13:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:13:49,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:50,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920022113] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:50,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:13:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2023-11-06 22:13:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215085360] [2023-11-06 22:13:50,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:50,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-06 22:13:50,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:50,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-06 22:13:50,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1670, Unknown=5, NotChecked=0, Total=1806 [2023-11-06 22:13:50,330 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 42 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 37 states have internal predecessors, (72), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:13:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:55,731 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2023-11-06 22:13:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:13:55,732 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 37 states have internal predecessors, (72), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2023-11-06 22:13:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:55,734 INFO L225 Difference]: With dead ends: 143 [2023-11-06 22:13:55,735 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 22:13:55,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=282, Invalid=3017, Unknown=7, NotChecked=0, Total=3306 [2023-11-06 22:13:55,738 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 165 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 43 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:55,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1016 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1969 Invalid, 5 Unknown, 0 Unchecked, 3.3s Time] [2023-11-06 22:13:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 22:13:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 102. [2023-11-06 22:13:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.2375) internal successors, (99), 88 states have internal predecessors, (99), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:13:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2023-11-06 22:13:55,788 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 46 [2023-11-06 22:13:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:55,790 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2023-11-06 22:13:55,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 37 states have internal predecessors, (72), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:13:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2023-11-06 22:13:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 22:13:55,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:55,795 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:55,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:13:56,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:56,002 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:56,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2136293516, now seen corresponding path program 1 times [2023-11-06 22:13:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:56,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157373153] [2023-11-06 22:13:56,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:13:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:13:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:13:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:00,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:14:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:14:00,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:00,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157373153] [2023-11-06 22:14:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157373153] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:00,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984128843] [2023-11-06 22:14:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:00,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:00,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:00,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:00,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:14:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:00,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 139 conjunts are in the unsatisfiable core [2023-11-06 22:14:00,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:00,615 INFO L322 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2023-11-06 22:14:00,616 INFO L351 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 1 case distinctions, treesize of input 16 treesize of output 12 [2023-11-06 22:14:00,820 WARN L861 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2023-11-06 22:14:00,834 INFO L351 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 [2023-11-06 22:14:01,111 INFO L351 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 14 treesize of output 15 [2023-11-06 22:14:01,126 INFO L351 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 18 treesize of output 7 [2023-11-06 22:14:01,295 INFO L322 Elim1Store]: treesize reduction 56, result has 52.9 percent of original size [2023-11-06 22:14:01,296 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 66 [2023-11-06 22:14:01,409 INFO L322 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2023-11-06 22:14:01,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 112 [2023-11-06 22:14:01,467 INFO L322 Elim1Store]: treesize reduction 59, result has 33.7 percent of original size [2023-11-06 22:14:01,467 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 182 [2023-11-06 22:14:01,525 INFO L322 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2023-11-06 22:14:01,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 104 [2023-11-06 22:14:01,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2023-11-06 22:14:01,721 INFO L322 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-06 22:14:01,721 INFO L351 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 22 treesize of output 24 [2023-11-06 22:14:01,765 INFO L322 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2023-11-06 22:14:01,766 INFO L351 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 27 treesize of output 37 [2023-11-06 22:14:01,780 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:14:01,781 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:14:01,813 INFO L351 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 8 treesize of output 7 [2023-11-06 22:14:02,059 INFO L322 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2023-11-06 22:14:02,059 INFO L351 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 25 treesize of output 29 [2023-11-06 22:14:02,324 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:14:02,325 INFO L351 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 64 treesize of output 49 [2023-11-06 22:14:02,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:02,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:02,374 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:14:02,375 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-06 22:14:02,524 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:14:02,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 31 [2023-11-06 22:14:02,532 INFO L351 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 11 treesize of output 7 [2023-11-06 22:14:02,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:02,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:02,546 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:14:02,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:14:03,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,037 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:14:03,038 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 131 [2023-11-06 22:14:03,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,089 INFO L322 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-06 22:14:03,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 141 treesize of output 83 [2023-11-06 22:14:03,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:03,136 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-06 22:14:03,137 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2023-11-06 22:14:03,163 INFO L322 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-06 22:14:03,164 INFO L351 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 34 [2023-11-06 22:14:05,737 INFO L322 Elim1Store]: treesize reduction 16, result has 83.5 percent of original size [2023-11-06 22:14:05,738 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 250 treesize of output 194 [2023-11-06 22:14:05,844 INFO L322 Elim1Store]: treesize reduction 8, result has 86.0 percent of original size [2023-11-06 22:14:05,844 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 126 [2023-11-06 22:14:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-06 22:14:07,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984128843] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:09,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:14:09,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 33 [2023-11-06 22:14:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958793740] [2023-11-06 22:14:09,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:09,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 22:14:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:09,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 22:14:09,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1021, Unknown=1, NotChecked=64, Total=1190 [2023-11-06 22:14:09,652 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 33 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 30 states have internal predecessors, (79), 8 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-06 22:14:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:16,932 INFO L93 Difference]: Finished difference Result 215 states and 267 transitions. [2023-11-06 22:14:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:14:16,933 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 30 states have internal predecessors, (79), 8 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 50 [2023-11-06 22:14:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:16,936 INFO L225 Difference]: With dead ends: 215 [2023-11-06 22:14:16,936 INFO L226 Difference]: Without dead ends: 212 [2023-11-06 22:14:16,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=291, Invalid=2468, Unknown=1, NotChecked=102, Total=2862 [2023-11-06 22:14:16,938 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 391 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:16,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 732 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1622 Invalid, 0 Unknown, 244 Unchecked, 3.9s Time] [2023-11-06 22:14:16,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-11-06 22:14:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 101. [2023-11-06 22:14:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.225) internal successors, (98), 87 states have internal predecessors, (98), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:14:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2023-11-06 22:14:16,988 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 50 [2023-11-06 22:14:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:16,989 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2023-11-06 22:14:16,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 30 states have internal predecessors, (79), 8 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-06 22:14:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2023-11-06 22:14:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 22:14:16,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:16,991 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:16,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:17,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:17,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:17,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2107365247, now seen corresponding path program 1 times [2023-11-06 22:14:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:17,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183339163] [2023-11-06 22:14:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:14:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:14:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:14:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:23,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183339163] [2023-11-06 22:14:23,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183339163] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:23,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417889028] [2023-11-06 22:14:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:23,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:23,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:23,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:23,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:14:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 163 conjunts are in the unsatisfiable core [2023-11-06 22:14:23,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:23,784 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:14:23,784 INFO L351 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 23 treesize of output 19 [2023-11-06 22:14:24,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:24,006 INFO L351 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 18 treesize of output 18 [2023-11-06 22:14:24,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:14:24,011 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2023-11-06 22:14:24,032 INFO L351 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 16 treesize of output 15 [2023-11-06 22:14:24,044 INFO L351 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 13 treesize of output 16 [2023-11-06 22:14:24,046 INFO L351 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 8 treesize of output 1 [2023-11-06 22:14:24,060 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:14:24,060 INFO L351 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 18 treesize of output 19 [2023-11-06 22:14:24,429 INFO L351 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 19 treesize of output 18 [2023-11-06 22:14:24,469 INFO L351 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 15 treesize of output 15 [2023-11-06 22:14:24,624 INFO L351 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 11 treesize of output 3 [2023-11-06 22:14:24,628 INFO L351 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 15 treesize of output 7 [2023-11-06 22:14:24,686 INFO L351 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 [2023-11-06 22:14:25,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,130 INFO L351 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 40 treesize of output 38 [2023-11-06 22:14:25,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-06 22:14:25,146 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:14:25,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,186 INFO L351 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 41 treesize of output 39 [2023-11-06 22:14:25,195 INFO L351 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 14 treesize of output 13 [2023-11-06 22:14:25,202 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-06 22:14:25,542 INFO L322 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-11-06 22:14:25,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 52 [2023-11-06 22:14:25,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-06 22:14:25,770 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-06 22:14:25,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 27 [2023-11-06 22:14:25,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:25,784 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:14:25,788 INFO L351 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 5 treesize of output 3 [2023-11-06 22:14:26,086 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-06 22:14:26,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 21 [2023-11-06 22:14:26,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2023-11-06 22:14:26,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:26,531 INFO L322 Elim1Store]: treesize reduction 59, result has 7.8 percent of original size [2023-11-06 22:14:26,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 72 [2023-11-06 22:14:26,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:14:26,552 INFO L351 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 60 treesize of output 46 [2023-11-06 22:14:26,573 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 22:14:26,574 INFO L351 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 [2023-11-06 22:14:27,982 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-06 22:14:27,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 35 [2023-11-06 22:14:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:14:28,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:28,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417889028] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:28,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:14:28,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 39 [2023-11-06 22:14:28,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363519180] [2023-11-06 22:14:28,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:28,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-06 22:14:28,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-06 22:14:28,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1439, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 22:14:28,664 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand has 39 states, 32 states have (on average 2.40625) internal successors, (77), 34 states have internal predecessors, (77), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:14:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:33,486 INFO L93 Difference]: Finished difference Result 225 states and 276 transitions. [2023-11-06 22:14:33,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:14:33,487 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 2.40625) internal successors, (77), 34 states have internal predecessors, (77), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2023-11-06 22:14:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:33,489 INFO L225 Difference]: With dead ends: 225 [2023-11-06 22:14:33,489 INFO L226 Difference]: Without dead ends: 155 [2023-11-06 22:14:33,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=237, Invalid=2519, Unknown=0, NotChecked=0, Total=2756 [2023-11-06 22:14:33,491 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 187 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 72 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:33,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 884 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1879 Invalid, 2 Unknown, 0 Unchecked, 3.3s Time] [2023-11-06 22:14:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-06 22:14:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2023-11-06 22:14:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 105 states have internal predecessors, (117), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:14:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2023-11-06 22:14:33,559 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 50 [2023-11-06 22:14:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:33,559 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2023-11-06 22:14:33,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 2.40625) internal successors, (77), 34 states have internal predecessors, (77), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:14:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2023-11-06 22:14:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 22:14:33,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:33,561 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:33,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:33,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:33,773 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:33,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash 458718687, now seen corresponding path program 1 times [2023-11-06 22:14:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:33,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431849803] [2023-11-06 22:14:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:14:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:14:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:41,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:14:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:14:41,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:41,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431849803] [2023-11-06 22:14:41,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431849803] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:41,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032636301] [2023-11-06 22:14:41,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:41,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:41,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:41,508 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:41,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:14:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:41,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 197 conjunts are in the unsatisfiable core [2023-11-06 22:14:41,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:41,858 INFO L322 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-11-06 22:14:41,859 INFO L351 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 4 case distinctions, treesize of input 35 treesize of output 34 [2023-11-06 22:14:41,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:14:42,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-06 22:14:42,132 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-06 22:14:42,273 INFO L322 Elim1Store]: treesize reduction 56, result has 52.9 percent of original size [2023-11-06 22:14:42,274 INFO L351 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 3 case distinctions, treesize of input 67 treesize of output 66 [2023-11-06 22:14:42,361 INFO L322 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2023-11-06 22:14:42,361 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 112 [2023-11-06 22:14:42,417 INFO L322 Elim1Store]: treesize reduction 60, result has 51.2 percent of original size [2023-11-06 22:14:42,418 INFO L351 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 115 [2023-11-06 22:14:42,470 INFO L322 Elim1Store]: treesize reduction 58, result has 50.4 percent of original size [2023-11-06 22:14:42,470 INFO L351 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 109 [2023-11-06 22:14:42,643 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:14:42,644 INFO L351 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 17 treesize of output 13 [2023-11-06 22:14:42,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-06 22:14:42,744 INFO L322 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-11-06 22:14:42,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 144 [2023-11-06 22:14:42,949 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-06 22:14:42,950 INFO L351 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 16 treesize of output 10 [2023-11-06 22:14:43,296 INFO L322 Elim1Store]: treesize reduction 78, result has 33.9 percent of original size [2023-11-06 22:14:43,296 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2023-11-06 22:14:43,855 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:43,856 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 56 [2023-11-06 22:14:43,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-11-06 22:14:44,117 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:44,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 38 [2023-11-06 22:14:44,146 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:14:44,154 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-06 22:14:44,480 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-06 22:14:44,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 21 [2023-11-06 22:14:44,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,869 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-11-06 22:14:44,876 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:14:44,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,910 INFO L322 Elim1Store]: treesize reduction 51, result has 8.9 percent of original size [2023-11-06 22:14:44,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 68 [2023-11-06 22:14:44,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:44,958 INFO L322 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-06 22:14:44,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 57 [2023-11-06 22:14:45,001 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-06 22:14:45,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-06 22:14:45,540 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 22:14:45,540 INFO L351 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 67 [2023-11-06 22:14:45,841 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:45,842 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 39 [2023-11-06 22:14:45,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:45,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2023-11-06 22:14:45,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:14:46,091 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-06 22:14:46,091 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 21 [2023-11-06 22:14:46,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,500 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2023-11-06 22:14:46,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,530 INFO L322 Elim1Store]: treesize reduction 43, result has 10.4 percent of original size [2023-11-06 22:14:46,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 67 [2023-11-06 22:14:46,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:14:46,595 INFO L322 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-11-06 22:14:46,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 35 [2023-11-06 22:14:46,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:14:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:14:49,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:15:00,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032636301] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:15:00,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:15:00,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28] total 44 [2023-11-06 22:15:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477696140] [2023-11-06 22:15:00,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:15:00,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-06 22:15:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:00,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-06 22:15:00,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2511, Unknown=2, NotChecked=0, Total=2756 [2023-11-06 22:15:00,123 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand has 44 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 40 states have internal predecessors, (85), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:15:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:15:12,012 INFO L93 Difference]: Finished difference Result 223 states and 273 transitions. [2023-11-06 22:15:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:15:12,013 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 40 states have internal predecessors, (85), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 53 [2023-11-06 22:15:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:15:12,016 INFO L225 Difference]: With dead ends: 223 [2023-11-06 22:15:12,016 INFO L226 Difference]: Without dead ends: 220 [2023-11-06 22:15:12,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=455, Invalid=4513, Unknown=2, NotChecked=0, Total=4970 [2023-11-06 22:15:12,020 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 345 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:15:12,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 730 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-11-06 22:15:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-06 22:15:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 121. [2023-11-06 22:15:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 104 states have internal predecessors, (116), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:15:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2023-11-06 22:15:12,102 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 53 [2023-11-06 22:15:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:15:12,103 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2023-11-06 22:15:12,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 40 states have internal predecessors, (85), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:15:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2023-11-06 22:15:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:15:12,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:15:12,105 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:12,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:15:12,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:15:12,314 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:15:12,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 172619215, now seen corresponding path program 1 times [2023-11-06 22:15:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734494705] [2023-11-06 22:15:12,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:15:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:15:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:17,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:15:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:20,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:15:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:15:22,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:22,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734494705] [2023-11-06 22:15:22,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734494705] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:15:22,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079667248] [2023-11-06 22:15:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:22,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:15:22,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:15:22,944 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:15:22,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:15:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:23,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 193 conjunts are in the unsatisfiable core [2023-11-06 22:15:23,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:15:23,329 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:15:23,330 INFO L351 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 23 treesize of output 19 [2023-11-06 22:15:23,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:23,700 INFO L351 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 18 treesize of output 18 [2023-11-06 22:15:23,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2023-11-06 22:15:23,718 INFO L351 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 16 treesize of output 15 [2023-11-06 22:15:23,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:15:23,758 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:15:23,759 INFO L351 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 18 treesize of output 19 [2023-11-06 22:15:23,768 INFO L351 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 13 treesize of output 16 [2023-11-06 22:15:23,772 INFO L351 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 8 treesize of output 1 [2023-11-06 22:15:24,293 INFO L351 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 15 treesize of output 15 [2023-11-06 22:15:24,318 INFO L351 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 19 treesize of output 18 [2023-11-06 22:15:24,523 INFO L351 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 11 treesize of output 3 [2023-11-06 22:15:24,529 INFO L351 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 15 treesize of output 7 [2023-11-06 22:15:24,629 INFO L351 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 [2023-11-06 22:15:25,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:25,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:25,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:25,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-11-06 22:15:25,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:15:25,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-06 22:15:25,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:25,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:25,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:25,373 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-11-06 22:15:25,385 INFO L351 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 14 treesize of output 13 [2023-11-06 22:15:25,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-06 22:15:25,872 INFO L322 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-11-06 22:15:25,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 56 [2023-11-06 22:15:25,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:25,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:25,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:25,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-06 22:15:26,198 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-06 22:15:26,198 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 31 [2023-11-06 22:15:26,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:26,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:26,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:26,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:15:26,225 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:15:27,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2023-11-06 22:15:27,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,289 INFO L322 Elim1Store]: treesize reduction 59, result has 7.8 percent of original size [2023-11-06 22:15:27,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 64 [2023-11-06 22:15:27,299 INFO L351 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 52 treesize of output 40 [2023-11-06 22:15:27,342 INFO L322 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-06 22:15:27,342 INFO L351 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 23 treesize of output 24 [2023-11-06 22:15:27,356 INFO L351 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 8 treesize of output 7 [2023-11-06 22:15:27,886 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-06 22:15:27,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 32 [2023-11-06 22:15:27,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-11-06 22:15:27,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:27,914 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:15:28,194 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_chain_node_#in~ppnode#1.base|))) (or (and (= (store |c_old(#memory_$Pointer$.offset)| |c_chain_node_#in~ppnode#1.base| .cse0) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |c_chain_node_#in~ppnode#1.base|) 0) (<= (+ |c_chain_node_#in~ppnode#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_chain_node_#in~ppnode#1.base| .cse1))) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |v_#memory_$Pointer$.offset_105|))) (and (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse2 (select |c_#memory_$Pointer$.offset| .cse2)) |c_chain_node_#in~ppnode#1.base| .cse0)) (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)) |c_chain_node_#in~ppnode#1.base| .cse1)) (= (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |v_#memory_$Pointer$.offset_105| .cse2)) |v_#memory_$Pointer$.offset_105|) (<= (+ .cse2 1) |c_#StackHeapBarrier|)))) (exists ((|chain_node_alloc_node_#res#1.base| Int)) (and (<= (+ |chain_node_alloc_node_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.base| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse1)) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.offset| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse0) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_alloc_node_#res#1.base|) 0))))) is different from false [2023-11-06 22:15:31,226 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_chain_node_#in~ppnode#1.base|))) (or (and (= (store |c_old(#memory_$Pointer$.offset)| |c_chain_node_#in~ppnode#1.base| .cse0) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |c_chain_node_#in~ppnode#1.base|) 0) (<= (+ |c_chain_node_#in~ppnode#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_chain_node_#in~ppnode#1.base| .cse1))) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |v_#memory_$Pointer$.offset_105|))) (and (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse2 (select |c_#memory_$Pointer$.offset| .cse2)) |c_chain_node_#in~ppnode#1.base| .cse0)) (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)) |c_chain_node_#in~ppnode#1.base| .cse1)) (= (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |v_#memory_$Pointer$.offset_105| .cse2)) |v_#memory_$Pointer$.offset_105|) (<= (+ .cse2 1) |c_#StackHeapBarrier|)))) (exists ((|chain_node_alloc_node_#res#1.base| Int)) (and (<= (+ |chain_node_alloc_node_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.base| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse1)) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.offset| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse0) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_alloc_node_#res#1.base|) 0))))) is different from true [2023-11-06 22:15:31,859 INFO L322 Elim1Store]: treesize reduction 219, result has 13.4 percent of original size [2023-11-06 22:15:31,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 160 treesize of output 192 [2023-11-06 22:15:32,045 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:15:32,046 INFO L351 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 3 case distinctions, treesize of input 85 treesize of output 109 [2023-11-06 22:15:33,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:33,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:15:33,598 INFO L322 Elim1Store]: treesize reduction 45, result has 10.0 percent of original size [2023-11-06 22:15:33,599 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 65 [2023-11-06 22:15:35,575 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#p2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#p1~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse6 (+ .cse2 2))) (let ((.cse0 (<= .cse6 |c_ULTIMATE.start_main_~#p1~0#1.base|)) (.cse1 (<= .cse6 |c_ULTIMATE.start_main_~#p2~0#1.base|)) (.cse3 (not (= .cse2 0)))) (or (and .cse0 .cse1 (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0)) .cse3 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse5 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (+ .cse5 2)) (.cse7 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse4 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse4 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse5 (select |v_#memory_$Pointer$.offset_105| .cse5)) |v_#memory_$Pointer$.offset_105|) (<= .cse6 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse2 |chain_node_alloc_node_#res#1.base|)) (<= .cse4 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse5 (select |c_#memory_$Pointer$.offset| .cse5)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse2) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse7 |c_ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse7 |c_ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse5 .cse2))))))) (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse12 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse12 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse8 (+ 2 v_prenex_42)) (.cse11 (select .cse10 .cse12)) (.cse9 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse8 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse6 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse2 v_prenex_42)) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse2 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse8 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse2) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_61 (select .cse10 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse9 |c_ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_62 .cse11) (= (select (select .cse10 .cse2) 0) (select (select .cse10 |c_ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= (select |c_#memory_$Pointer$.base| .cse12) .cse11) (<= .cse9 |c_ULTIMATE.start_main_~#p1~0#1.base|)))))) .cse3))))) (= |c_ULTIMATE.start_main_~#p1~0#1.offset| 0)) is different from false [2023-11-06 22:15:35,587 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#p2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#p1~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse6 (+ .cse2 2))) (let ((.cse0 (<= .cse6 |c_ULTIMATE.start_main_~#p1~0#1.base|)) (.cse1 (<= .cse6 |c_ULTIMATE.start_main_~#p2~0#1.base|)) (.cse3 (not (= .cse2 0)))) (or (and .cse0 .cse1 (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0)) .cse3 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse5 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (+ .cse5 2)) (.cse7 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse4 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse4 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse5 (select |v_#memory_$Pointer$.offset_105| .cse5)) |v_#memory_$Pointer$.offset_105|) (<= .cse6 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse2 |chain_node_alloc_node_#res#1.base|)) (<= .cse4 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse5 (select |c_#memory_$Pointer$.offset| .cse5)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse2) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse7 |c_ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse7 |c_ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse5 .cse2))))))) (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse12 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse12 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse8 (+ 2 v_prenex_42)) (.cse11 (select .cse10 .cse12)) (.cse9 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse8 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse6 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse2 v_prenex_42)) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse2 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse8 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse2) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_61 (select .cse10 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse9 |c_ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_62 .cse11) (= (select (select .cse10 .cse2) 0) (select (select .cse10 |c_ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= (select |c_#memory_$Pointer$.base| .cse12) .cse11) (<= .cse9 |c_ULTIMATE.start_main_~#p1~0#1.base|)))))) .cse3))))) (= |c_ULTIMATE.start_main_~#p1~0#1.offset| 0)) is different from true [2023-11-06 22:15:40,313 WARN L839 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse0 (+ .cse3 2))) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse6 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse2 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse1 (+ 2 v_prenex_42)) (.cse5 (select .cse4 .cse6))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0) |c_ULTIMATE.start_main_#t~mem22#1.base|) (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_#t~mem22#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse3 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse4 .cse3) 0) (select (select .cse4 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_61 (select .cse4 v_prenex_42)) (not (= .cse3 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse3) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_62 .cse5) (= (select |c_#memory_$Pointer$.base| .cse6) .cse5)))))) (= .cse3 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse3 0)))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse8 (+ .cse7 2))) (and (= .cse7 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse11 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse10 (+ .cse11 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (.cse12 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= .cse9 |c_ULTIMATE.start_main_#t~mem22#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse10 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse11 (select |v_#memory_$Pointer$.offset_105| .cse11)) |v_#memory_$Pointer$.offset_105|) (= |c_ULTIMATE.start_main_#t~mem22#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse12 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse10 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse9 (select (select |c_#memory_$Pointer$.base| .cse7) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse11 (select |c_#memory_$Pointer$.offset| .cse11)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse7 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse12 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse11 .cse7)) (<= .cse12 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse7) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)))))) (not (= .cse7 0))))))) is different from false [2023-11-06 22:15:40,327 WARN L861 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse0 (+ .cse3 2))) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse6 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse2 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse1 (+ 2 v_prenex_42)) (.cse5 (select .cse4 .cse6))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0) |c_ULTIMATE.start_main_#t~mem22#1.base|) (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_#t~mem22#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse3 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse4 .cse3) 0) (select (select .cse4 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_61 (select .cse4 v_prenex_42)) (not (= .cse3 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse3) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_62 .cse5) (= (select |c_#memory_$Pointer$.base| .cse6) .cse5)))))) (= .cse3 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse3 0)))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse8 (+ .cse7 2))) (and (= .cse7 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse11 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse10 (+ .cse11 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (.cse12 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= .cse9 |c_ULTIMATE.start_main_#t~mem22#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse10 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse11 (select |v_#memory_$Pointer$.offset_105| .cse11)) |v_#memory_$Pointer$.offset_105|) (= |c_ULTIMATE.start_main_#t~mem22#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse12 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse10 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse9 (select (select |c_#memory_$Pointer$.base| .cse7) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse11 (select |c_#memory_$Pointer$.offset| .cse11)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse7 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse12 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse11 .cse7)) (<= .cse12 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse7) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)))))) (not (= .cse7 0))))))) is different from true [2023-11-06 22:15:41,171 WARN L839 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse0 (+ .cse5 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) |c_check_seq_next_#in~beg.offset|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse1 (+ .cse2 2)) (.cse3 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$.offset_105| .cse2)) |v_#memory_$Pointer$.offset_105|) (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse3 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= |c_check_seq_next_#in~end.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse4 (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse2 (select |c_#memory_$Pointer$.offset| .cse2)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse5 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse2 .cse5)) (<= .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) (= .cse4 |c_check_seq_next_#in~end.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse5) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)))))) (= .cse5 |c_check_seq_next_#in~beg.base|) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse5 0)))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse7 (+ .cse6 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) |c_check_seq_next_#in~beg.offset|) (= .cse6 |c_check_seq_next_#in~beg.base|) (<= .cse7 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse6 0)) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse12 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse12 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse9 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse8 (+ 2 v_prenex_42)) (.cse11 (select .cse10 .cse12))) (and (<= .cse7 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= |c_check_seq_next_#in~end.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse6 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse10 .cse6) 0) (select (select .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0) |c_check_seq_next_#in~end.base|) (= v_DerPreprocessor_61 (select .cse10 v_prenex_42)) (not (= .cse6 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_62 .cse11) (= (select |c_#memory_$Pointer$.base| .cse12) .cse11))))))))))) is different from false [2023-11-06 22:15:41,183 WARN L861 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse0 (+ .cse5 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) |c_check_seq_next_#in~beg.offset|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse1 (+ .cse2 2)) (.cse3 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$.offset_105| .cse2)) |v_#memory_$Pointer$.offset_105|) (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse3 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= |c_check_seq_next_#in~end.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse4 (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse2 (select |c_#memory_$Pointer$.offset| .cse2)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse5 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse2 .cse5)) (<= .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) (= .cse4 |c_check_seq_next_#in~end.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse5) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)))))) (= .cse5 |c_check_seq_next_#in~beg.base|) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse5 0)))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse7 (+ .cse6 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) |c_check_seq_next_#in~beg.offset|) (= .cse6 |c_check_seq_next_#in~beg.base|) (<= .cse7 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse6 0)) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse12 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse12 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse9 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse8 (+ 2 v_prenex_42)) (.cse11 (select .cse10 .cse12))) (and (<= .cse7 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= |c_check_seq_next_#in~end.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse6 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse10 .cse6) 0) (select (select .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0) |c_check_seq_next_#in~end.base|) (= v_DerPreprocessor_61 (select .cse10 v_prenex_42)) (not (= .cse6 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_62 .cse11) (= (select |c_#memory_$Pointer$.base| .cse12) .cse11))))))))))) is different from true [2023-11-06 22:15:41,993 WARN L839 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse1 (+ .cse0 2))) (and (= .cse0 c_check_seq_next_~beg.base) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse6 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse3 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse2 (+ 2 v_prenex_42)) (.cse5 (select .cse4 .cse6))) (and (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse2 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse3 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= c_check_seq_next_~end.offset (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse0 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse4 .cse0) 0) (select (select .cse4 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_61 (select .cse4 v_prenex_42)) (not (= .cse0 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse2 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse0) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= v_DerPreprocessor_62 .cse5) (= (select |c_#memory_$Pointer$.base| .cse6) .cse5)))))) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) c_check_seq_next_~beg.offset))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse8 (+ .cse7 2))) (and (= .cse7 c_check_seq_next_~beg.base) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse10 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse9 (+ .cse10 2)) (.cse11 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse10 (select |v_#memory_$Pointer$.offset_105| .cse10)) |v_#memory_$Pointer$.offset_105|) (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse12 (select (select |c_#memory_$Pointer$.base| .cse7) 0)) (= c_check_seq_next_~end.offset (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse10 (select |c_#memory_$Pointer$.offset| .cse10)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse7 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse11 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse10 .cse7)) (<= .cse11 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse7) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base .cse12))))) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) c_check_seq_next_~beg.offset)))))) is different from false [2023-11-06 22:15:42,006 WARN L861 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse1 (+ .cse0 2))) (and (= .cse0 c_check_seq_next_~beg.base) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse6 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse3 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse2 (+ 2 v_prenex_42)) (.cse5 (select .cse4 .cse6))) (and (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse2 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse3 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= c_check_seq_next_~end.offset (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse0 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse4 .cse0) 0) (select (select .cse4 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_61 (select .cse4 v_prenex_42)) (not (= .cse0 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse2 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse0) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= v_DerPreprocessor_62 .cse5) (= (select |c_#memory_$Pointer$.base| .cse6) .cse5)))))) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) c_check_seq_next_~beg.offset))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse8 (+ .cse7 2))) (and (= .cse7 c_check_seq_next_~beg.base) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse10 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse9 (+ .cse10 2)) (.cse11 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse10 (select |v_#memory_$Pointer$.offset_105| .cse10)) |v_#memory_$Pointer$.offset_105|) (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse12 (select (select |c_#memory_$Pointer$.base| .cse7) 0)) (= c_check_seq_next_~end.offset (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse10 (select |c_#memory_$Pointer$.offset| .cse10)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse7 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse11 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse10 .cse7)) (<= .cse11 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse7) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base .cse12))))) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) c_check_seq_next_~beg.offset)))))) is different from true [2023-11-06 22:15:46,730 WARN L839 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|ULTIMATE.start_main_~#p1~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse3 (store (store |v_#memory_$Pointer$.offset_105| .cse6 v_DerPreprocessor_64) |ULTIMATE.start_create_sll_~#list~0#1.base| v_DerPreprocessor_65))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse5 (+ .cse6 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse4)) (.cse0 (+ .cse4 2)) (.cse7 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= c_check_seq_next_~beg.base (select .cse1 .cse2)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select .cse3 .cse4) .cse2) c_check_seq_next_~beg.offset) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse5 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6 (select |v_#memory_$Pointer$.offset_105| .cse6)) |v_#memory_$Pointer$.offset_105|) (<= .cse5 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse5 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse8 (select .cse1 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) 0) c_check_seq_next_~end.offset) (not (= .cse4 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse7 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse6 .cse4)) (<= .cse7 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= .cse4 0)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse4) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base .cse8)))))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|ULTIMATE.start_main_~#p1~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int) (v_DerPreprocessor_66 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int))) (let ((.cse17 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse17 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (.cse12 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse10 (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 v_DerPreprocessor_66) |ULTIMATE.start_create_sll_~#list~0#1.base| v_DerPreprocessor_67))) (let ((.cse13 (select (select .cse10 |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse9 (+ .cse12 2)) (.cse14 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse11 (+ 2 v_prenex_42)) (.cse16 (select .cse15 .cse17))) (and (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) 0) c_check_seq_next_~end.offset) (<= .cse11 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse12) .cse13) c_check_seq_next_~beg.base) (<= .cse14 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse12 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse15 .cse12) 0) (select (select .cse15 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= (select (select .cse10 .cse12) .cse13) c_check_seq_next_~beg.offset) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse14 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse14 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= .cse12 0)) (= v_DerPreprocessor_61 (select .cse15 v_prenex_42)) (not (= .cse12 v_prenex_42)) (<= .cse11 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse12) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= v_DerPreprocessor_62 .cse16) (= (select |c_#memory_$Pointer$.base| .cse17) .cse16))))))) is different from false [2023-11-06 22:15:46,742 WARN L861 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|ULTIMATE.start_main_~#p1~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse3 (store (store |v_#memory_$Pointer$.offset_105| .cse6 v_DerPreprocessor_64) |ULTIMATE.start_create_sll_~#list~0#1.base| v_DerPreprocessor_65))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse5 (+ .cse6 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse4)) (.cse0 (+ .cse4 2)) (.cse7 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= c_check_seq_next_~beg.base (select .cse1 .cse2)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select .cse3 .cse4) .cse2) c_check_seq_next_~beg.offset) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse5 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6 (select |v_#memory_$Pointer$.offset_105| .cse6)) |v_#memory_$Pointer$.offset_105|) (<= .cse5 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse5 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse8 (select .cse1 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) 0) c_check_seq_next_~end.offset) (not (= .cse4 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse7 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse6 .cse4)) (<= .cse7 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= .cse4 0)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse4) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base .cse8)))))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|ULTIMATE.start_main_~#p1~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int) (v_DerPreprocessor_66 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int))) (let ((.cse17 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse17 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (.cse12 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse10 (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 v_DerPreprocessor_66) |ULTIMATE.start_create_sll_~#list~0#1.base| v_DerPreprocessor_67))) (let ((.cse13 (select (select .cse10 |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse9 (+ .cse12 2)) (.cse14 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse11 (+ 2 v_prenex_42)) (.cse16 (select .cse15 .cse17))) (and (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) 0) c_check_seq_next_~end.offset) (<= .cse11 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse12) .cse13) c_check_seq_next_~beg.base) (<= .cse14 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse12 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse15 .cse12) 0) (select (select .cse15 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= (select (select .cse10 .cse12) .cse13) c_check_seq_next_~beg.offset) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse14 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse14 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= .cse12 0)) (= v_DerPreprocessor_61 (select .cse15 v_prenex_42)) (not (= .cse12 v_prenex_42)) (<= .cse11 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse12) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= v_DerPreprocessor_62 .cse16) (= (select |c_#memory_$Pointer$.base| .cse17) .cse16))))))) is different from true [2023-11-06 22:15:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2023-11-06 22:15:46,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:15:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079667248] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:15:50,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:15:50,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 44 [2023-11-06 22:15:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424808814] [2023-11-06 22:15:50,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:15:50,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-06 22:15:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:50,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-06 22:15:50,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1916, Unknown=14, NotChecked=558, Total=2652 [2023-11-06 22:15:50,241 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 44 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-06 22:15:51,855 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_chain_node_#in~ppnode#1.base|))) (let ((.cse2 (= (store |c_old(#memory_$Pointer$.offset)| |c_chain_node_#in~ppnode#1.base| .cse7) |c_#memory_$Pointer$.offset|)) (.cse3 (= (select |c_old(#valid)| |c_chain_node_#in~ppnode#1.base|) 0)) (.cse4 (<= (+ |c_chain_node_#in~ppnode#1.base| 1) |c_#StackHeapBarrier|)) (.cse5 (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_chain_node_#in~ppnode#1.base| .cse8))) (.cse0 (select .cse8 |c_chain_node_#in~ppnode#1.offset|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_55 (Array Int Int))) (= |c_#memory_$Pointer$.base| (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| .cse0 (store v_DerPreprocessor_55 0 (select (select (store |c_old(#memory_$Pointer$.base)| .cse0 v_DerPreprocessor_55) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse1 |c_chain_node_#in~ppnode#1.base| (store (select .cse1 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| .cse0))))) (or (and .cse2 .cse3 .cse4 .cse5) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |c_old(#memory_$Pointer$.offset)| |v_#memory_$Pointer$.offset_105|))) (and (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)) |c_chain_node_#in~ppnode#1.base| .cse7)) (= (select |c_old(#valid)| .cse6) 0) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| .cse6 (select |c_#memory_$Pointer$.base| .cse6)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= (store |c_old(#memory_$Pointer$.offset)| .cse6 (select |v_#memory_$Pointer$.offset_105| .cse6)) |v_#memory_$Pointer$.offset_105|) (<= (+ .cse6 1) |c_#StackHeapBarrier|)))) (exists ((|chain_node_alloc_node_#res#1.base| Int)) (and (<= (+ |chain_node_alloc_node_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.base| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.offset| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse7) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_alloc_node_#res#1.base|) 0)))) (or (and .cse2 .cse3 .cse4 (= |c_#valid| (store |c_old(#valid)| |c_chain_node_#in~ppnode#1.base| (select |c_#valid| |c_chain_node_#in~ppnode#1.base|))) .cse5) (exists ((|chain_node_alloc_node_#res#1.base| Int) (v_DerPreprocessor_57 (Array Int Int))) (and (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_#res#1.base| (select |c_#valid| |chain_node_alloc_node_#res#1.base|))) (<= (+ |chain_node_alloc_node_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.base| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| (store v_DerPreprocessor_57 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| v_DerPreprocessor_57) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| .cse7)) (= (select |c_old(#valid)| |chain_node_alloc_node_#res#1.base|) 0)))) (exists ((v_DerPreprocessor_56 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| .cse0 (store v_DerPreprocessor_56 0 (select (select (store |c_old(#memory_$Pointer$.offset)| .cse0 v_DerPreprocessor_56) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse9 |c_chain_node_#in~ppnode#1.base| (store (select .cse9 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0))))) (= |c_chain_node_~ppnode#1.base| |c_chain_node_#in~ppnode#1.base|) (= |c_chain_node_alloc_node_#res#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_chain_node_#in~ppnode#1.offset| |c_chain_node_~ppnode#1.offset|) (not (= .cse0 0))))) is different from false [2023-11-06 22:15:51,866 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_chain_node_#in~ppnode#1.base|))) (let ((.cse2 (= (store |c_old(#memory_$Pointer$.offset)| |c_chain_node_#in~ppnode#1.base| .cse7) |c_#memory_$Pointer$.offset|)) (.cse3 (= (select |c_old(#valid)| |c_chain_node_#in~ppnode#1.base|) 0)) (.cse4 (<= (+ |c_chain_node_#in~ppnode#1.base| 1) |c_#StackHeapBarrier|)) (.cse5 (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_chain_node_#in~ppnode#1.base| .cse8))) (.cse0 (select .cse8 |c_chain_node_#in~ppnode#1.offset|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_55 (Array Int Int))) (= |c_#memory_$Pointer$.base| (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| .cse0 (store v_DerPreprocessor_55 0 (select (select (store |c_old(#memory_$Pointer$.base)| .cse0 v_DerPreprocessor_55) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse1 |c_chain_node_#in~ppnode#1.base| (store (select .cse1 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| .cse0))))) (or (and .cse2 .cse3 .cse4 .cse5) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |c_old(#memory_$Pointer$.offset)| |v_#memory_$Pointer$.offset_105|))) (and (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)) |c_chain_node_#in~ppnode#1.base| .cse7)) (= (select |c_old(#valid)| .cse6) 0) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| .cse6 (select |c_#memory_$Pointer$.base| .cse6)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= (store |c_old(#memory_$Pointer$.offset)| .cse6 (select |v_#memory_$Pointer$.offset_105| .cse6)) |v_#memory_$Pointer$.offset_105|) (<= (+ .cse6 1) |c_#StackHeapBarrier|)))) (exists ((|chain_node_alloc_node_#res#1.base| Int)) (and (<= (+ |chain_node_alloc_node_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.base| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.offset| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse7) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_alloc_node_#res#1.base|) 0)))) (or (and .cse2 .cse3 .cse4 (= |c_#valid| (store |c_old(#valid)| |c_chain_node_#in~ppnode#1.base| (select |c_#valid| |c_chain_node_#in~ppnode#1.base|))) .cse5) (exists ((|chain_node_alloc_node_#res#1.base| Int) (v_DerPreprocessor_57 (Array Int Int))) (and (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_#res#1.base| (select |c_#valid| |chain_node_alloc_node_#res#1.base|))) (<= (+ |chain_node_alloc_node_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.base| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| (store v_DerPreprocessor_57 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| v_DerPreprocessor_57) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| .cse7)) (= (select |c_old(#valid)| |chain_node_alloc_node_#res#1.base|) 0)))) (exists ((v_DerPreprocessor_56 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| .cse0 (store v_DerPreprocessor_56 0 (select (select (store |c_old(#memory_$Pointer$.offset)| .cse0 v_DerPreprocessor_56) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse9 |c_chain_node_#in~ppnode#1.base| (store (select .cse9 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0))))) (= |c_chain_node_~ppnode#1.base| |c_chain_node_#in~ppnode#1.base|) (= |c_chain_node_alloc_node_#res#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_chain_node_#in~ppnode#1.offset| |c_chain_node_~ppnode#1.offset|) (not (= .cse0 0))))) is different from true [2023-11-06 22:15:51,899 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_chain_node_#in~ppnode#1.base|))) (let ((.cse2 (= (store |c_old(#memory_$Pointer$.offset)| |c_chain_node_#in~ppnode#1.base| .cse7) |c_#memory_$Pointer$.offset|)) (.cse3 (= (select |c_old(#valid)| |c_chain_node_#in~ppnode#1.base|) 0)) (.cse4 (<= (+ |c_chain_node_#in~ppnode#1.base| 1) |c_#StackHeapBarrier|)) (.cse5 (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_chain_node_#in~ppnode#1.base| .cse8))) (.cse0 (select .cse8 |c_chain_node_#in~ppnode#1.offset|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_55 (Array Int Int))) (= |c_#memory_$Pointer$.base| (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| .cse0 (store v_DerPreprocessor_55 0 (select (select (store |c_old(#memory_$Pointer$.base)| .cse0 v_DerPreprocessor_55) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse1 |c_chain_node_#in~ppnode#1.base| (store (select .cse1 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| .cse0))))) (or (and .cse2 .cse3 .cse4 .cse5) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |c_old(#memory_$Pointer$.offset)| |v_#memory_$Pointer$.offset_105|))) (and (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)) |c_chain_node_#in~ppnode#1.base| .cse7)) (= (select |c_old(#valid)| .cse6) 0) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| .cse6 (select |c_#memory_$Pointer$.base| .cse6)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= (store |c_old(#memory_$Pointer$.offset)| .cse6 (select |v_#memory_$Pointer$.offset_105| .cse6)) |v_#memory_$Pointer$.offset_105|) (<= (+ .cse6 1) |c_#StackHeapBarrier|)))) (exists ((|chain_node_alloc_node_#res#1.base| Int)) (and (<= (+ |chain_node_alloc_node_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.base| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.offset| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse7) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_alloc_node_#res#1.base|) 0)))) (or (and .cse2 .cse3 .cse4 (= |c_#valid| (store |c_old(#valid)| |c_chain_node_#in~ppnode#1.base| (select |c_#valid| |c_chain_node_#in~ppnode#1.base|))) .cse5) (exists ((|chain_node_alloc_node_#res#1.base| Int) (v_DerPreprocessor_57 (Array Int Int))) (and (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_#res#1.base| (select |c_#valid| |chain_node_alloc_node_#res#1.base|))) (<= (+ |chain_node_alloc_node_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.base| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| (store v_DerPreprocessor_57 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| v_DerPreprocessor_57) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| .cse7)) (= (select |c_old(#valid)| |chain_node_alloc_node_#res#1.base|) 0)))) (exists ((v_DerPreprocessor_56 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| .cse0 (store v_DerPreprocessor_56 0 (select (select (store |c_old(#memory_$Pointer$.offset)| .cse0 v_DerPreprocessor_56) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse9 |c_chain_node_#in~ppnode#1.base| (store (select .cse9 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0))))) (= (select |c_#valid| .cse0) 1) (not (= .cse0 0))))) is different from false [2023-11-06 22:15:52,340 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_chain_node_#in~ppnode#1.base|))) (let ((.cse2 (= (store |c_old(#memory_$Pointer$.offset)| |c_chain_node_#in~ppnode#1.base| .cse7) |c_#memory_$Pointer$.offset|)) (.cse3 (= (select |c_old(#valid)| |c_chain_node_#in~ppnode#1.base|) 0)) (.cse4 (<= (+ |c_chain_node_#in~ppnode#1.base| 1) |c_#StackHeapBarrier|)) (.cse5 (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_chain_node_#in~ppnode#1.base| .cse8))) (.cse0 (select .cse8 |c_chain_node_#in~ppnode#1.offset|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_55 (Array Int Int))) (= |c_#memory_$Pointer$.base| (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| .cse0 (store v_DerPreprocessor_55 0 (select (select (store |c_old(#memory_$Pointer$.base)| .cse0 v_DerPreprocessor_55) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse1 |c_chain_node_#in~ppnode#1.base| (store (select .cse1 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| .cse0))))) (or (and .cse2 .cse3 .cse4 .cse5) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |c_old(#memory_$Pointer$.offset)| |v_#memory_$Pointer$.offset_105|))) (and (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)) |c_chain_node_#in~ppnode#1.base| .cse7)) (= (select |c_old(#valid)| .cse6) 0) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| .cse6 (select |c_#memory_$Pointer$.base| .cse6)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= (store |c_old(#memory_$Pointer$.offset)| .cse6 (select |v_#memory_$Pointer$.offset_105| .cse6)) |v_#memory_$Pointer$.offset_105|) (<= (+ .cse6 1) |c_#StackHeapBarrier|)))) (exists ((|chain_node_alloc_node_#res#1.base| Int)) (and (<= (+ |chain_node_alloc_node_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.base| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.offset| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse7) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_alloc_node_#res#1.base|) 0)))) (or (and .cse2 .cse3 .cse4 (= |c_#valid| (store |c_old(#valid)| |c_chain_node_#in~ppnode#1.base| (select |c_#valid| |c_chain_node_#in~ppnode#1.base|))) .cse5) (exists ((|chain_node_alloc_node_#res#1.base| Int) (v_DerPreprocessor_57 (Array Int Int))) (and (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_#res#1.base| (select |c_#valid| |chain_node_alloc_node_#res#1.base|))) (<= (+ |chain_node_alloc_node_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_#res#1.base| (select |c_#memory_$Pointer$.base| |chain_node_alloc_node_#res#1.base|)) |c_chain_node_#in~ppnode#1.base| .cse8)) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| (store v_DerPreprocessor_57 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_alloc_node_#res#1.base| v_DerPreprocessor_57) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| .cse7)) (= (select |c_old(#valid)| |chain_node_alloc_node_#res#1.base|) 0)))) (exists ((v_DerPreprocessor_56 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| .cse0 (store v_DerPreprocessor_56 0 (select (select (store |c_old(#memory_$Pointer$.offset)| .cse0 v_DerPreprocessor_56) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse9 |c_chain_node_#in~ppnode#1.base| (store (select .cse9 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0))))) (= (select |c_#valid| .cse0) 1) (not (= .cse0 0))))) is different from true [2023-11-06 22:16:00,943 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p1~0#1.base|))) (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (.cse1 (select .cse17 |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~#p2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#p1~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#p2~0#1.base| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= (select .cse3 |c_ULTIMATE.start_main_~#p2~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (not (= .cse1 |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#p1~0#1.base| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (let ((.cse6 (select .cse17 0))) (let ((.cse10 (+ .cse6 2))) (let ((.cse4 (<= .cse10 |c_ULTIMATE.start_main_~#p1~0#1.base|)) (.cse5 (<= .cse10 |c_ULTIMATE.start_main_~#p2~0#1.base|)) (.cse7 (not (= .cse6 0)))) (or (and .cse4 .cse5 (= (select (select |c_#memory_$Pointer$.base| .cse6) 0) (select .cse3 0)) .cse7 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse9 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse8 (+ .cse9 2)) (.cse11 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse8 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse8 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse9 (select |v_#memory_$Pointer$.offset_105| .cse9)) |v_#memory_$Pointer$.offset_105|) (<= .cse10 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse6 |chain_node_alloc_node_#res#1.base|)) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse9 (select |c_#memory_$Pointer$.offset| .cse9)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse11 |c_ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse11 |c_ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse9 .cse6))))))) (and .cse4 .cse5 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse16 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse16 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse12 (+ 2 v_prenex_42)) (.cse15 (select .cse14 .cse16)) (.cse13 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse12 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse10 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse6 v_prenex_42)) (<= .cse13 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse6 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse12 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse12 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_61 (select .cse14 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse13 |c_ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_62 .cse15) (= (select (select .cse14 .cse6) 0) (select (select .cse14 |c_ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= (select |c_#memory_$Pointer$.base| .cse16) .cse15) (<= .cse13 |c_ULTIMATE.start_main_~#p1~0#1.base|)))))) .cse7))))) (= |c_ULTIMATE.start_main_~#p1~0#1.offset| 0) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2023-11-06 22:16:00,954 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p1~0#1.base|))) (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (.cse1 (select .cse17 |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~#p2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#p1~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#p2~0#1.base| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= (select .cse3 |c_ULTIMATE.start_main_~#p2~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse1) .cse2)) (not (= .cse1 |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#p1~0#1.base| |c_ULTIMATE.start_create_sll_~#list~0#1.base|)) (let ((.cse6 (select .cse17 0))) (let ((.cse10 (+ .cse6 2))) (let ((.cse4 (<= .cse10 |c_ULTIMATE.start_main_~#p1~0#1.base|)) (.cse5 (<= .cse10 |c_ULTIMATE.start_main_~#p2~0#1.base|)) (.cse7 (not (= .cse6 0)))) (or (and .cse4 .cse5 (= (select (select |c_#memory_$Pointer$.base| .cse6) 0) (select .cse3 0)) .cse7 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse9 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse8 (+ .cse9 2)) (.cse11 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse8 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse8 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse9 (select |v_#memory_$Pointer$.offset_105| .cse9)) |v_#memory_$Pointer$.offset_105|) (<= .cse10 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse6 |chain_node_alloc_node_#res#1.base|)) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse9 (select |c_#memory_$Pointer$.offset| .cse9)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse11 |c_ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse11 |c_ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse9 .cse6))))))) (and .cse4 .cse5 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse16 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse16 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse12 (+ 2 v_prenex_42)) (.cse15 (select .cse14 .cse16)) (.cse13 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse12 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse10 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse6 v_prenex_42)) (<= .cse13 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse6 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse12 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse12 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_61 (select .cse14 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse13 |c_ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_62 .cse15) (= (select (select .cse14 .cse6) 0) (select (select .cse14 |c_ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= (select |c_#memory_$Pointer$.base| .cse16) .cse15) (<= .cse13 |c_ULTIMATE.start_main_~#p1~0#1.base|)))))) .cse7))))) (= |c_ULTIMATE.start_main_~#p1~0#1.offset| 0) (not (= (select |c_#valid| .cse1) 0))))) is different from true [2023-11-06 22:16:00,993 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p1~0#1.base|))) (let ((.cse0 (select .cse16 |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p2~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#p2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#p1~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#p2~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (let ((.cse5 (select .cse16 0))) (let ((.cse9 (+ .cse5 2))) (let ((.cse3 (<= .cse9 |c_ULTIMATE.start_main_~#p1~0#1.base|)) (.cse4 (<= .cse9 |c_ULTIMATE.start_main_~#p2~0#1.base|)) (.cse6 (not (= .cse5 0)))) (or (and .cse3 .cse4 (= (select (select |c_#memory_$Pointer$.base| .cse5) 0) (select .cse2 0)) .cse6 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse8 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse7 (+ .cse8 2)) (.cse10 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse7 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse7 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse8 (select |v_#memory_$Pointer$.offset_105| .cse8)) |v_#memory_$Pointer$.offset_105|) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse10 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse5 |chain_node_alloc_node_#res#1.base|)) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse8 (select |c_#memory_$Pointer$.offset| .cse8)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse5) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse10 |c_ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse10 |c_ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse8 .cse5))))))) (and .cse3 .cse4 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse15 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse15 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse11 (+ 2 v_prenex_42)) (.cse14 (select .cse13 .cse15)) (.cse12 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse11 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse5 v_prenex_42)) (<= .cse12 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse5 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse11 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse5) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_61 (select .cse13 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse12 |c_ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_62 .cse14) (= (select (select .cse13 .cse5) 0) (select (select .cse13 |c_ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= (select |c_#memory_$Pointer$.base| .cse15) .cse14) (<= .cse12 |c_ULTIMATE.start_main_~#p1~0#1.base|)))))) .cse6))))) (= |c_ULTIMATE.start_main_~#p1~0#1.offset| 0)))) is different from false [2023-11-06 22:16:01,004 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p1~0#1.base|))) (let ((.cse0 (select .cse16 |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p2~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#p2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#p1~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#p2~0#1.offset|) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (let ((.cse5 (select .cse16 0))) (let ((.cse9 (+ .cse5 2))) (let ((.cse3 (<= .cse9 |c_ULTIMATE.start_main_~#p1~0#1.base|)) (.cse4 (<= .cse9 |c_ULTIMATE.start_main_~#p2~0#1.base|)) (.cse6 (not (= .cse5 0)))) (or (and .cse3 .cse4 (= (select (select |c_#memory_$Pointer$.base| .cse5) 0) (select .cse2 0)) .cse6 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse8 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse7 (+ .cse8 2)) (.cse10 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse7 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse7 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse8 (select |v_#memory_$Pointer$.offset_105| .cse8)) |v_#memory_$Pointer$.offset_105|) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse10 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse5 |chain_node_alloc_node_#res#1.base|)) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse8 (select |c_#memory_$Pointer$.offset| .cse8)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse5) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse10 |c_ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse10 |c_ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse8 .cse5))))))) (and .cse3 .cse4 (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse15 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse15 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse11 (+ 2 v_prenex_42)) (.cse14 (select .cse13 .cse15)) (.cse12 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse11 |c_ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse5 v_prenex_42)) (<= .cse12 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse5 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse11 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse5) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_61 (select .cse13 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |c_ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse12 |c_ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_62 .cse14) (= (select (select .cse13 .cse5) 0) (select (select .cse13 |c_ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= (select |c_#memory_$Pointer$.base| .cse15) .cse14) (<= .cse12 |c_ULTIMATE.start_main_~#p1~0#1.base|)))))) .cse6))))) (= |c_ULTIMATE.start_main_~#p1~0#1.offset| 0)))) is different from true [2023-11-06 22:16:01,060 WARN L839 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base|) |c_ULTIMATE.start_main_#t~mem21#1.offset|) |c_ULTIMATE.start_main_#t~mem22#1.base|) (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse0 (+ .cse3 2))) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse6 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse2 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse1 (+ 2 v_prenex_42)) (.cse5 (select .cse4 .cse6))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0) |c_ULTIMATE.start_main_#t~mem22#1.base|) (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_#t~mem22#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse3 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse4 .cse3) 0) (select (select .cse4 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_61 (select .cse4 v_prenex_42)) (not (= .cse3 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse3) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_62 .cse5) (= (select |c_#memory_$Pointer$.base| .cse6) .cse5)))))) (= .cse3 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse3 0)))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse8 (+ .cse7 2))) (and (= .cse7 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse11 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse10 (+ .cse11 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (.cse12 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= .cse9 |c_ULTIMATE.start_main_#t~mem22#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse10 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse11 (select |v_#memory_$Pointer$.offset_105| .cse11)) |v_#memory_$Pointer$.offset_105|) (= |c_ULTIMATE.start_main_#t~mem22#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse12 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse10 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse9 (select (select |c_#memory_$Pointer$.base| .cse7) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse11 (select |c_#memory_$Pointer$.offset| .cse11)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse7 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse12 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse11 .cse7)) (<= .cse12 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse7) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)))))) (not (= .cse7 0))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base|) |c_ULTIMATE.start_main_#t~mem21#1.offset|) |c_ULTIMATE.start_main_#t~mem22#1.offset|)) is different from false [2023-11-06 22:16:01,075 WARN L861 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base|) |c_ULTIMATE.start_main_#t~mem21#1.offset|) |c_ULTIMATE.start_main_#t~mem22#1.base|) (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse0 (+ .cse3 2))) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse6 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse2 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse1 (+ 2 v_prenex_42)) (.cse5 (select .cse4 .cse6))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0) |c_ULTIMATE.start_main_#t~mem22#1.base|) (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_#t~mem22#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse3 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse4 .cse3) 0) (select (select .cse4 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_61 (select .cse4 v_prenex_42)) (not (= .cse3 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse3) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_62 .cse5) (= (select |c_#memory_$Pointer$.base| .cse6) .cse5)))))) (= .cse3 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse3 0)))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse8 (+ .cse7 2))) (and (= .cse7 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse11 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse10 (+ .cse11 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (.cse12 (+ 2 |chain_node_alloc_node_#res#1.base|))) (and (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= .cse9 |c_ULTIMATE.start_main_#t~mem22#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse10 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse11 (select |v_#memory_$Pointer$.offset_105| .cse11)) |v_#memory_$Pointer$.offset_105|) (= |c_ULTIMATE.start_main_#t~mem22#1.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse12 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse10 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse9 (select (select |c_#memory_$Pointer$.base| .cse7) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse11 (select |c_#memory_$Pointer$.offset| .cse11)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse7 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse12 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse11 .cse7)) (<= .cse12 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse7) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)))))) (not (= .cse7 0))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base|) |c_ULTIMATE.start_main_#t~mem21#1.offset|) |c_ULTIMATE.start_main_#t~mem22#1.offset|)) is different from true [2023-11-06 22:16:01,165 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_check_seq_next_#in~end.offset| (select (select |c_#memory_$Pointer$.offset| |c_check_seq_next_#in~beg.base|) |c_check_seq_next_#in~beg.offset|)) (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse0 (+ .cse5 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) |c_check_seq_next_#in~beg.offset|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse1 (+ .cse2 2)) (.cse3 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$.offset_105| .cse2)) |v_#memory_$Pointer$.offset_105|) (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse3 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= |c_check_seq_next_#in~end.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse4 (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse2 (select |c_#memory_$Pointer$.offset| .cse2)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse5 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse2 .cse5)) (<= .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) (= .cse4 |c_check_seq_next_#in~end.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse5) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)))))) (= .cse5 |c_check_seq_next_#in~beg.base|) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse5 0)))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse7 (+ .cse6 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) |c_check_seq_next_#in~beg.offset|) (= .cse6 |c_check_seq_next_#in~beg.base|) (<= .cse7 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse6 0)) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse12 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse12 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse9 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse8 (+ 2 v_prenex_42)) (.cse11 (select .cse10 .cse12))) (and (<= .cse7 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= |c_check_seq_next_#in~end.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse6 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse10 .cse6) 0) (select (select .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0) |c_check_seq_next_#in~end.base|) (= v_DerPreprocessor_61 (select .cse10 v_prenex_42)) (not (= .cse6 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_62 .cse11) (= (select |c_#memory_$Pointer$.base| .cse12) .cse11))))))))))) (= (select (select |c_#memory_$Pointer$.base| |c_check_seq_next_#in~beg.base|) |c_check_seq_next_#in~beg.offset|) |c_check_seq_next_#in~end.base|)) is different from false [2023-11-06 22:16:01,179 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_check_seq_next_#in~end.offset| (select (select |c_#memory_$Pointer$.offset| |c_check_seq_next_#in~beg.base|) |c_check_seq_next_#in~beg.offset|)) (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse0 (+ .cse5 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) |c_check_seq_next_#in~beg.offset|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse2 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse1 (+ .cse2 2)) (.cse3 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse2 (select |v_#memory_$Pointer$.offset_105| .cse2)) |v_#memory_$Pointer$.offset_105|) (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse3 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= |c_check_seq_next_#in~end.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse4 (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse2 (select |c_#memory_$Pointer$.offset| .cse2)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse5 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse2 .cse5)) (<= .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) (= .cse4 |c_check_seq_next_#in~end.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse5) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)))))) (= .cse5 |c_check_seq_next_#in~beg.base|) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse5 0)))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse7 (+ .cse6 2))) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) |c_check_seq_next_#in~beg.offset|) (= .cse6 |c_check_seq_next_#in~beg.base|) (<= .cse7 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse6 0)) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse12 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse12 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse9 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse8 (+ 2 v_prenex_42)) (.cse11 (select .cse10 .cse12))) (and (<= .cse7 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= |c_check_seq_next_#in~end.offset| (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse6 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse10 .cse6) 0) (select (select .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0) |c_check_seq_next_#in~end.base|) (= v_DerPreprocessor_61 (select .cse10 v_prenex_42)) (not (= .cse6 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= v_DerPreprocessor_62 .cse11) (= (select |c_#memory_$Pointer$.base| .cse12) .cse11))))))))))) (= (select (select |c_#memory_$Pointer$.base| |c_check_seq_next_#in~beg.base|) |c_check_seq_next_#in~beg.offset|) |c_check_seq_next_#in~end.base|)) is different from true [2023-11-06 22:16:01,244 WARN L839 $PredicateComparison]: unable to prove that (and (= c_check_seq_next_~end.base (select (select |c_#memory_$Pointer$.base| c_check_seq_next_~beg.base) c_check_seq_next_~beg.offset)) (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse1 (+ .cse0 2))) (and (= .cse0 c_check_seq_next_~beg.base) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse6 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse3 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse2 (+ 2 v_prenex_42)) (.cse5 (select .cse4 .cse6))) (and (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse2 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse3 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= c_check_seq_next_~end.offset (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse0 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse4 .cse0) 0) (select (select .cse4 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_61 (select .cse4 v_prenex_42)) (not (= .cse0 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse2 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse0) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= v_DerPreprocessor_62 .cse5) (= (select |c_#memory_$Pointer$.base| .cse6) .cse5)))))) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) c_check_seq_next_~beg.offset))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse8 (+ .cse7 2))) (and (= .cse7 c_check_seq_next_~beg.base) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse10 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse9 (+ .cse10 2)) (.cse11 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse10 (select |v_#memory_$Pointer$.offset_105| .cse10)) |v_#memory_$Pointer$.offset_105|) (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse12 (select (select |c_#memory_$Pointer$.base| .cse7) 0)) (= c_check_seq_next_~end.offset (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse10 (select |c_#memory_$Pointer$.offset| .cse10)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse7 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse11 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse10 .cse7)) (<= .cse11 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse7) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base .cse12))))) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) c_check_seq_next_~beg.offset)))))) (= (select (select |c_#memory_$Pointer$.offset| c_check_seq_next_~beg.base) c_check_seq_next_~beg.offset) c_check_seq_next_~end.offset)) is different from false [2023-11-06 22:16:01,256 WARN L861 $PredicateComparison]: unable to prove that (and (= c_check_seq_next_~end.base (select (select |c_#memory_$Pointer$.base| c_check_seq_next_~beg.base) c_check_seq_next_~beg.offset)) (or (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse1 (+ .cse0 2))) (and (= .cse0 c_check_seq_next_~beg.base) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse6 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse3 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse2 (+ 2 v_prenex_42)) (.cse5 (select .cse4 .cse6))) (and (<= .cse1 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (<= .cse2 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (<= .cse3 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= c_check_seq_next_~end.offset (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse0 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse4 .cse0) 0) (select (select .cse4 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (<= .cse1 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) (= v_DerPreprocessor_61 (select .cse4 v_prenex_42)) (not (= .cse0 v_prenex_42)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 (select |c_#memory_$Pointer$.offset| v_prenex_42)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= .cse2 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse0) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= v_DerPreprocessor_62 .cse5) (= (select |c_#memory_$Pointer$.base| .cse6) .cse5)))))) (<= .cse1 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) c_check_seq_next_~beg.offset))))) (exists ((|ULTIMATE.start_main_~#p1~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0))) (let ((.cse8 (+ .cse7 2))) (and (= .cse7 c_check_seq_next_~beg.base) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse10 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse9 (+ .cse10 2)) (.cse11 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse8 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse10 (select |v_#memory_$Pointer$.offset_105| .cse10)) |v_#memory_$Pointer$.offset_105|) (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse12 (select (select |c_#memory_$Pointer$.base| .cse7) 0)) (= c_check_seq_next_~end.offset (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_105| .cse10 (select |c_#memory_$Pointer$.offset| .cse10)) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (= .cse7 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse11 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse10 .cse7)) (<= .cse11 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse7) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base .cse12))))) (<= .cse8 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#p1~0#1.base|) 0) c_check_seq_next_~beg.offset)))))) (= (select (select |c_#memory_$Pointer$.offset| c_check_seq_next_~beg.base) c_check_seq_next_~beg.offset) c_check_seq_next_~end.offset)) is different from true [2023-11-06 22:16:01,315 WARN L839 $PredicateComparison]: unable to prove that (and (= c_check_seq_next_~beg.offset c_check_seq_next_~end.offset) (= c_check_seq_next_~end.base c_check_seq_next_~beg.base) (or (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|ULTIMATE.start_main_~#p1~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse3 (store (store |v_#memory_$Pointer$.offset_105| .cse6 v_DerPreprocessor_64) |ULTIMATE.start_create_sll_~#list~0#1.base| v_DerPreprocessor_65))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse5 (+ .cse6 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse4)) (.cse0 (+ .cse4 2)) (.cse7 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= c_check_seq_next_~beg.base (select .cse1 .cse2)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select .cse3 .cse4) .cse2) c_check_seq_next_~beg.offset) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse5 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6 (select |v_#memory_$Pointer$.offset_105| .cse6)) |v_#memory_$Pointer$.offset_105|) (<= .cse5 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse5 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse8 (select .cse1 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) 0) c_check_seq_next_~end.offset) (not (= .cse4 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse7 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse6 .cse4)) (<= .cse7 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= .cse4 0)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse4) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base .cse8)))))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|ULTIMATE.start_main_~#p1~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int) (v_DerPreprocessor_66 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int))) (let ((.cse17 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse17 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (.cse12 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse10 (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 v_DerPreprocessor_66) |ULTIMATE.start_create_sll_~#list~0#1.base| v_DerPreprocessor_67))) (let ((.cse13 (select (select .cse10 |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse9 (+ .cse12 2)) (.cse14 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse11 (+ 2 v_prenex_42)) (.cse16 (select .cse15 .cse17))) (and (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) 0) c_check_seq_next_~end.offset) (<= .cse11 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse12) .cse13) c_check_seq_next_~beg.base) (<= .cse14 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse12 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse15 .cse12) 0) (select (select .cse15 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= (select (select .cse10 .cse12) .cse13) c_check_seq_next_~beg.offset) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse14 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse14 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= .cse12 0)) (= v_DerPreprocessor_61 (select .cse15 v_prenex_42)) (not (= .cse12 v_prenex_42)) (<= .cse11 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse12) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= v_DerPreprocessor_62 .cse16) (= (select |c_#memory_$Pointer$.base| .cse17) .cse16)))))))) is different from false [2023-11-06 22:16:01,326 WARN L861 $PredicateComparison]: unable to prove that (and (= c_check_seq_next_~beg.offset c_check_seq_next_~end.offset) (= c_check_seq_next_~end.base c_check_seq_next_~beg.base) (or (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|ULTIMATE.start_main_~#p1~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int)) (let ((.cse6 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse3 (store (store |v_#memory_$Pointer$.offset_105| .cse6 v_DerPreprocessor_64) |ULTIMATE.start_create_sll_~#list~0#1.base| v_DerPreprocessor_65))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse5 (+ .cse6 2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse4)) (.cse0 (+ .cse4 2)) (.cse7 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0))) (and (<= .cse0 |ULTIMATE.start_main_~#p2~0#1.base|) (= c_check_seq_next_~beg.base (select .cse1 .cse2)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select .cse3 .cse4) .cse2) c_check_seq_next_~beg.offset) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse5 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse6 (select |v_#memory_$Pointer$.offset_105| .cse6)) |v_#memory_$Pointer$.offset_105|) (<= .cse5 |ULTIMATE.start_main_~#p2~0#1.base|) (<= .cse7 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse5 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse8 (select .cse1 0)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select .cse3 |ULTIMATE.start_main_~#p2~0#1.base|) 0) c_check_seq_next_~end.offset) (not (= .cse4 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse7 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse0 |ULTIMATE.start_main_~#p1~0#1.base|) (not (= .cse6 .cse4)) (<= .cse7 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= .cse4 0)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse4) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base .cse8)))))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_18| (Array Int (Array Int Int))) (v_DerPreprocessor_62 (Array Int Int)) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#p2~0#1.base| Int) (v_DerPreprocessor_61 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (|ULTIMATE.start_main_~#p1~0#1.base| Int) (|chain_node_alloc_node_#res#1.base| Int) (v_prenex_42 Int) (v_DerPreprocessor_66 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int))) (let ((.cse17 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |v_#memory_$Pointer$.offset_105|))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| v_prenex_42 v_DerPreprocessor_61) .cse17 v_DerPreprocessor_62) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (.cse12 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse10 (store (store |v_#memory_$Pointer$.offset_BEFORE_CALL_18| v_prenex_42 v_DerPreprocessor_66) |ULTIMATE.start_create_sll_~#list~0#1.base| v_DerPreprocessor_67))) (let ((.cse13 (select (select .cse10 |ULTIMATE.start_main_~#p1~0#1.base|) 0)) (.cse9 (+ .cse12 2)) (.cse14 (+ 2 |chain_node_alloc_node_#res#1.base|)) (.cse11 (+ 2 v_prenex_42)) (.cse16 (select .cse15 .cse17))) (and (<= .cse9 |ULTIMATE.start_main_~#p2~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p1~0#1.base|) 0) 0) (= (select (select .cse10 |ULTIMATE.start_main_~#p2~0#1.base|) 0) c_check_seq_next_~end.offset) (<= .cse11 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= |ULTIMATE.start_main_~#p2~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |ULTIMATE.start_main_~#p2~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse12) .cse13) c_check_seq_next_~beg.base) (<= .cse14 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p1~0#1.base|)) (<= .cse11 |ULTIMATE.start_create_sll_~#list~0#1.base|) (not (= .cse12 |chain_node_alloc_node_#res#1.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| |chain_node_alloc_node_#res#1.base|) 0) 0) (= (select (select .cse15 .cse12) 0) (select (select .cse15 |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= (select (select .cse10 .cse12) .cse13) c_check_seq_next_~beg.offset) (<= .cse9 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse14 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse9 |ULTIMATE.start_main_~#p1~0#1.base|) (<= .cse14 |ULTIMATE.start_main_~#p2~0#1.base|) (not (= .cse12 0)) (= v_DerPreprocessor_61 (select .cse15 v_prenex_42)) (not (= .cse12 v_prenex_42)) (<= .cse11 |ULTIMATE.start_main_~#p1~0#1.base|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_18| .cse12) 0) 0) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |ULTIMATE.start_main_~#p2~0#1.base|)) (= c_check_seq_next_~end.base (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#p2~0#1.base|) 0)) (= v_DerPreprocessor_62 .cse16) (= (select |c_#memory_$Pointer$.base| .cse17) .cse16)))))))) is different from true [2023-11-06 22:16:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:16:02,554 INFO L93 Difference]: Finished difference Result 259 states and 312 transitions. [2023-11-06 22:16:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 22:16:02,555 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 59 [2023-11-06 22:16:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:16:02,557 INFO L225 Difference]: With dead ends: 259 [2023-11-06 22:16:02,557 INFO L226 Difference]: Without dead ends: 190 [2023-11-06 22:16:02,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=302, Invalid=3029, Unknown=31, NotChecked=1750, Total=5112 [2023-11-06 22:16:02,561 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 134 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 4028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2058 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:16:02,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 815 Invalid, 4028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1920 Invalid, 1 Unknown, 2058 Unchecked, 8.5s Time] [2023-11-06 22:16:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-06 22:16:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 121. [2023-11-06 22:16:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 104 states have internal predecessors, (116), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:16:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2023-11-06 22:16:02,642 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 59 [2023-11-06 22:16:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:16:02,643 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2023-11-06 22:16:02,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-06 22:16:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2023-11-06 22:16:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:16:02,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:16:02,644 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:02,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:16:02,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:16:02,852 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:16:02,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1282090149, now seen corresponding path program 1 times [2023-11-06 22:16:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:02,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029778879] [2023-11-06 22:16:02,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:02,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:16:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:06,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:16:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:16:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:09,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:16:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:16:14,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:14,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029778879] [2023-11-06 22:16:14,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029778879] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:16:14,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792391469] [2023-11-06 22:16:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:14,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:16:14,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:16:14,633 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:16:14,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4189b73b-e87a-4fe4-a0db-4fccaacf5ff8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:16:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:14,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 180 conjunts are in the unsatisfiable core [2023-11-06 22:16:14,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:16:15,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-11-06 22:16:15,532 INFO L322 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-11-06 22:16:15,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2023-11-06 22:16:15,549 INFO L351 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 12 treesize of output 11 [2023-11-06 22:16:15,568 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:16:15,569 INFO L351 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 12 treesize of output 1 [2023-11-06 22:16:15,613 INFO L351 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 55 treesize of output 20 [2023-11-06 22:16:16,370 INFO L351 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 17 treesize of output 12 [2023-11-06 22:16:16,714 INFO L351 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 8 treesize of output 4 [2023-11-06 22:16:16,922 INFO L351 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 [2023-11-06 22:16:17,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2023-11-06 22:16:17,649 INFO L351 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 20 treesize of output 19 [2023-11-06 22:16:17,684 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 50 [2023-11-06 22:16:17,745 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:16:17,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2023-11-06 22:16:18,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:18,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:18,495 INFO L351 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 33 [2023-11-06 22:16:18,511 INFO L351 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 14 treesize of output 13 [2023-11-06 22:16:18,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-11-06 22:16:19,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:19,166 INFO L351 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 14 [2023-11-06 22:16:19,181 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:16:19,181 INFO L351 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 31 treesize of output 18 [2023-11-06 22:16:19,190 INFO L351 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 5 treesize of output 3 [2023-11-06 22:16:22,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:22,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:22,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:22,424 INFO L351 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 41 treesize of output 36 [2023-11-06 22:16:22,440 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-06 22:16:22,475 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-06 22:16:22,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:22,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:22,580 INFO L322 Elim1Store]: treesize reduction 59, result has 7.8 percent of original size [2023-11-06 22:16:22,581 INFO L351 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 57 [2023-11-06 22:16:22,604 INFO L351 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 14 treesize of output 13 [2023-11-06 22:16:22,698 INFO L322 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-06 22:16:22,699 INFO L351 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 27 treesize of output 33 [2023-11-06 22:16:22,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 38 [2023-11-06 22:16:23,835 INFO L322 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-11-06 22:16:23,835 INFO L351 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 111 treesize of output 74 [2023-11-06 22:16:23,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:23,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:23,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-11-06 22:16:24,495 INFO L322 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-06 22:16:24,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 49 [2023-11-06 22:16:24,515 INFO L351 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 11 treesize of output 7 [2023-11-06 22:16:24,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:24,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:24,536 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-06 22:16:25,543 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (and (exists ((v_ArrVal_2492 (Array Int Int))) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| .cse1 v_ArrVal_2492))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| .cse1))) |c_#memory_$Pointer$.base|)) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse1) 0) (let ((.cse2 (= .cse1 |c_chain_node_#in~ppnode#1.base|))) (or (and (exists ((v_DerPreprocessor_77 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| .cse1 (store v_DerPreprocessor_77 0 (select (select (store |c_old(#memory_$Pointer$.offset)| .cse1 v_DerPreprocessor_77) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)) |c_#memory_$Pointer$.offset|)) .cse2) (and (exists ((v_DerPreprocessor_78 (Array Int Int))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1)) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| .cse1 (store v_DerPreprocessor_78 0 (select (select (store |c_old(#memory_$Pointer$.offset)| .cse1 v_DerPreprocessor_78) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)) |c_#memory_$Pointer$.offset|)) (not .cse2)))) (not (= .cse1 0)))) is different from true [2023-11-06 22:16:25,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:25,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:25,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:25,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:25,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:25,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:25,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2023-11-06 22:16:25,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:25,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:25,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:25,841 INFO L322 Elim1Store]: treesize reduction 130, result has 7.8 percent of original size [2023-11-06 22:16:25,842 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 151 treesize of output 125 [2023-11-06 22:16:25,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 81 [2023-11-06 22:16:25,932 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:16:26,026 INFO L322 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2023-11-06 22:16:26,026 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2023-11-06 22:16:30,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:30,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:30,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:16:30,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-11-06 22:16:31,248 INFO L322 Elim1Store]: treesize reduction 45, result has 8.2 percent of original size [2023-11-06 22:16:31,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 68 [2023-11-06 22:16:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 16 refuted. 2 times theorem prover too weak. 1 trivial. 6 not checked. [2023-11-06 22:16:31,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:16:33,448 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2505 (Array Int Int)) (v_ArrVal_2504 (Array Int Int)) (|v_chain_node_~node~0#1.base_22| Int) (v_ArrVal_2507 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_chain_node_~node~0#1.base_22| 1)) (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_22|) 0)) (= |v_chain_node_~node~0#1.base_22| 0) (not (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_22| v_ArrVal_2504) |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_22| (store v_ArrVal_2507 0 (select (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_22| v_ArrVal_2507) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 0))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_22| v_ArrVal_2505))) (store .cse4 |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| |v_chain_node_~node~0#1.base_22|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) 0)))) is different from false [2023-11-06 22:16:33,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792391469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:16:33,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:16:33,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 49 [2023-11-06 22:16:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369024874] [2023-11-06 22:16:33,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:16:33,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-06 22:16:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:33,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-06 22:16:33,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2590, Unknown=3, NotChecked=206, Total=2970 [2023-11-06 22:16:33,458 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 49 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 44 states have internal predecessors, (90), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:16:39,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:16:44,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:16:47,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:16:58,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]