./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 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_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:20:40,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:20:41,069 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 21:20:41,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:20:41,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:20:41,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:20:41,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:20:41,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:20:41,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:20:41,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:20:41,112 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:20:41,112 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:20:41,113 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:20:41,114 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:20:41,114 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:20:41,115 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:20:41,116 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:20:41,116 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:20:41,117 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:20:41,118 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:20:41,118 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:20:41,125 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:20:41,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:20:41,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:20:41,127 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:20:41,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:20:41,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:20:41,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:20:41,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:20:41,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:20:41,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:20:41,131 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:20:41,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:20:41,132 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:20:41,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:20:41,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:20:41,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:20:41,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:20:41,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:20:41,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:20:41,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:20:41,142 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:20:41,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:20:41,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:20:41,143 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:20:41,143 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:20:41,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:20:41,144 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/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_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-11-23 21:20:41,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:20:41,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:20:41,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:20:41,575 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:20:41,576 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:20:41,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-23 21:20:45,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:20:45,812 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:20:45,813 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-23 21:20:45,843 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/data/6732d8b32/ed81d7edeeb041a0aa8f2eab535a23bd/FLAG4c84f061d [2023-11-23 21:20:45,859 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/data/6732d8b32/ed81d7edeeb041a0aa8f2eab535a23bd [2023-11-23 21:20:45,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:20:45,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:20:45,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:20:45,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:20:45,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:20:45,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:20:45" (1/1) ... [2023-11-23 21:20:45,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b1a428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45, skipping insertion in model container [2023-11-23 21:20:45,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:20:45" (1/1) ... [2023-11-23 21:20:45,972 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:20:46,420 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_aff837d3-92c2-47c5-98f3-417b7f354482/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-23 21:20:46,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:20:46,440 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:20:46,502 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_aff837d3-92c2-47c5-98f3-417b7f354482/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-23 21:20:46,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:20:46,547 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:20:46,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46 WrapperNode [2023-11-23 21:20:46,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:20:46,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:20:46,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:20:46,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:20:46,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,621 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 174 [2023-11-23 21:20:46,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:20:46,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:20:46,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:20:46,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:20:46,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:20:46,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:20:46,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:20:46,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:20:46,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (1/1) ... [2023-11-23 21:20:46,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:20:46,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:20:46,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:20:46,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:20:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:20:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:20:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-23 21:20:46,798 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-23 21:20:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 21:20:46,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:20:46,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:20:46,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 21:20:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 21:20:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:20:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 21:20:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:20:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:20:46,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:20:46,990 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:20:46,993 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:20:47,322 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:20:47,506 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:20:47,506 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-23 21:20:47,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:47 BoogieIcfgContainer [2023-11-23 21:20:47,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:20:47,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:20:47,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:20:47,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:20:47,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:20:45" (1/3) ... [2023-11-23 21:20:47,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef903c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:20:47, skipping insertion in model container [2023-11-23 21:20:47,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:46" (2/3) ... [2023-11-23 21:20:47,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef903c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:20:47, skipping insertion in model container [2023-11-23 21:20:47,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:47" (3/3) ... [2023-11-23 21:20:47,530 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-11-23 21:20:47,553 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:20:47,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:20:47,608 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:20:47,617 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23c904d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:20:47,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:20:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:20:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:20:47,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:20:47,634 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:20:47,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:20:47,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:20:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2126984656, now seen corresponding path program 1 times [2023-11-23 21:20:47,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:20:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397688706] [2023-11-23 21:20:47,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:47,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:20:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:20:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:20:48,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:20:48,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397688706] [2023-11-23 21:20:48,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397688706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:20:48,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:20:48,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:20:48,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983914379] [2023-11-23 21:20:48,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:20:48,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:20:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:20:48,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:20:48,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:20:48,419 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:20:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:20:48,665 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2023-11-23 21:20:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:20:48,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-11-23 21:20:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:20:48,681 INFO L225 Difference]: With dead ends: 55 [2023-11-23 21:20:48,682 INFO L226 Difference]: Without dead ends: 26 [2023-11-23 21:20:48,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:20:48,698 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:20:48,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:20:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-23 21:20:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-23 21:20:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:20:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-11-23 21:20:48,750 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2023-11-23 21:20:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:20:48,750 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-23 21:20:48,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 21:20:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-11-23 21:20:48,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 21:20:48,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:20:48,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:20:48,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:20:48,754 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:20:48,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:20:48,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1438178616, now seen corresponding path program 1 times [2023-11-23 21:20:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:20:48,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462658998] [2023-11-23 21:20:48,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:20:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:20:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 21:20:49,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:20:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462658998] [2023-11-23 21:20:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462658998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:20:49,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:20:49,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:20:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638633858] [2023-11-23 21:20:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:20:49,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:20:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:20:49,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:20:49,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:20:49,209 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 21:20:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:20:49,407 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2023-11-23 21:20:49,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:20:49,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2023-11-23 21:20:49,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:20:49,409 INFO L225 Difference]: With dead ends: 36 [2023-11-23 21:20:49,409 INFO L226 Difference]: Without dead ends: 25 [2023-11-23 21:20:49,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:20:49,412 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:20:49,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:20:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-23 21:20:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-23 21:20:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 21:20:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-11-23 21:20:49,429 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 22 [2023-11-23 21:20:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:20:49,430 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-11-23 21:20:49,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 21:20:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-11-23 21:20:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 21:20:49,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:20:49,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:20:49,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:20:49,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:20:49,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:20:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1746210744, now seen corresponding path program 1 times [2023-11-23 21:20:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:20:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115603877] [2023-11-23 21:20:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:20:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:20:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:20:53,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:20:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115603877] [2023-11-23 21:20:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115603877] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:20:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816217927] [2023-11-23 21:20:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:53,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:20:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:20:53,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:20:53,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aff837d3-92c2-47c5-98f3-417b7f354482/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:20:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:20:53,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 135 conjunts are in the unsatisfiable core [2023-11-23 21:20:53,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:20:54,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:20:54,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 21:20:54,738 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 21:20:54,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 21:20:54,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-23 21:20:55,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-23 21:20:55,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2023-11-23 21:20:55,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 21:20:55,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 21:20:55,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 21:20:55,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:20:55,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 21:20:55,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:20:55,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2023-11-23 21:20:55,928 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-23 21:20:55,928 INFO L378 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 20 treesize of output 22 [2023-11-23 21:20:55,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-23 21:20:56,756 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 21:20:56,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 77 [2023-11-23 21:20:56,804 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-23 21:20:56,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 130 [2023-11-23 21:20:56,823 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 21:20:56,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 75 [2023-11-23 21:20:56,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:20:56,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-23 21:20:56,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:20:56,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:20:56,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-23 21:20:56,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-23 21:20:56,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 21:20:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:20:57,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:21:00,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0)) (.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0))) (and (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_22 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_19)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_21) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (and .cse0 .cse1)) (or (not .cse1) (not .cse0) (let ((.cse7 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)) (.cse8 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0))) (and (or (and (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_83))) (or (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_81))) (or (not (= v_DerPreprocessor_80 (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (forall ((v_DerPreprocessor_84 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) (not (= v_DerPreprocessor_82 (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))) (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_83))) (or (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_80) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_81))) (or (forall ((v_DerPreprocessor_85 (Array Int Int)) (v_DerPreprocessor_86 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_85) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_86))) (or (not (= v_DerPreprocessor_85 (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) (not (= v_DerPreprocessor_80 (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))) (not (= v_DerPreprocessor_82 (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))))))) (not .cse7) (not .cse8)) (or (and .cse7 .cse8) (and (or (forall ((v_ArrVal_338 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (forall ((v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_78) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (forall ((v_ArrVal_338 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (let ((.cse14 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse24 (not .cse14))) (and (or (forall ((v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_68 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_64) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_65))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| .cse10 v_DerPreprocessor_66) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_67)) (.cse11 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_68) .cse10 v_DerPreprocessor_69) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_70))) (or (not (= .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= v_DerPreprocessor_68 (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_11) .cse10 (select .cse12 .cse10)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_11)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) .cse14) (or (and (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_62 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_55) v_DerPreprocessor_13 v_DerPreprocessor_56) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_57))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) v_DerPreprocessor_13 (select .cse16 v_DerPreprocessor_13)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= v_DerPreprocessor_13 .cse15)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_58) .cse15 v_DerPreprocessor_59) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_60) (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_61) .cse15 v_DerPreprocessor_62) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= v_DerPreprocessor_13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (= v_DerPreprocessor_13 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_49))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_52) .cse18 v_DerPreprocessor_53) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_54))) (or (not (= (select .cse17 .cse18) v_DerPreprocessor_53)) (not (= .cse18 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_51) (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) .cse14) (or (and (forall ((v_prenex_19 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_45) .cse21 v_DerPreprocessor_46) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_47))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_44) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_45)) (not (= v_prenex_18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_18) .cse21 v_prenex_19) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (not (= .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= (select .cse20 .cse21) v_DerPreprocessor_46)))))) (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_41) .cse23 v_DerPreprocessor_42) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_43))) (or (not (= (select .cse22 .cse23) v_DerPreprocessor_42)) (not (= (select .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_41)) (not (= .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_40) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_17) .cse23 v_DerPreprocessor_12) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_17))))))) .cse24) (or (and (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse25) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse27 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_25) .cse26 v_DerPreprocessor_26) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_27))) (or (not (= .cse25 v_DerPreprocessor_14)) (not (= v_prenex_17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_17) .cse26 v_DerPreprocessor_12) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (not (= .cse26 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= v_DerPreprocessor_26 (select .cse27 .cse26))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_24) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select .cse27 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_25))))))) (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_13 v_DerPreprocessor_32) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_33))) (let ((.cse28 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_14) v_DerPreprocessor_13 (select .cse30 v_DerPreprocessor_13)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse29 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_36) .cse28 v_DerPreprocessor_37) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_38))) (or (not (= v_DerPreprocessor_13 .cse28)) (= v_DerPreprocessor_13 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= v_DerPreprocessor_36 (select .cse29 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse28 v_DerPreprocessor_34) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_35) (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse31) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_29) .cse33 v_DerPreprocessor_30) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_31))) (or (not (= .cse31 v_DerPreprocessor_14)) (not (= v_DerPreprocessor_29 (select .cse32 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (not (= .cse33 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= v_DerPreprocessor_30 (select .cse32 .cse33))) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_18) .cse33 v_prenex_19) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_18)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_28) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) .cse24))))) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse34 v_DerPreprocessor_71) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_72) (select (select (store (store |c_#memory_$Pointer$.base| .cse34 v_DerPreprocessor_73) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse34 v_DerPreprocessor_75) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= .cse34 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= .cse34 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))))))))) is different from false [2023-11-23 21:21:08,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816217927] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:21:08,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1766654701] [2023-11-23 21:21:08,089 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-23 21:21:08,089 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:21:08,094 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 21:21:08,103 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 21:21:08,104 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 21:21:10,293 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-23 21:21:10,307 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 21:21:20,226 WARN L293 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 176 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-23 21:21:36,998 WARN L293 SmtUtils]: Spent 6.44s on a formula simplification that was a NOOP. DAG size: 170 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)