./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ --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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:01:50,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:01:50,616 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:01:50,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:01:50,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:01:50,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:01:50,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:01:50,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:01:50,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:01:50,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:01:50,658 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:01:50,659 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:01:50,660 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:01:50,660 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:01:50,661 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:01:50,662 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:01:50,662 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:01:50,663 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:01:50,663 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:01:50,664 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:01:50,665 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:01:50,665 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:01:50,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:01:50,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:01:50,668 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:01:50,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:01:50,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:01:50,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:01:50,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:01:50,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:01:50,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:01:50,671 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:01:50,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:01:50,672 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:01:50,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:01:50,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:01:50,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:01:50,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:01:50,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:01:50,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:01:50,674 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:01:50,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:01:50,675 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:01:50,675 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:01:50,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:01:50,676 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_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/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_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2023-11-19 05:01:50,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:01:51,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:01:51,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:01:51,029 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:01:51,030 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:01:51,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-19 05:01:54,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:01:54,646 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:01:54,646 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-19 05:01:54,664 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/data/a899fdb81/bb9796a3650341c6beb89e370981b21e/FLAG5152de2f3 [2023-11-19 05:01:54,684 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/data/a899fdb81/bb9796a3650341c6beb89e370981b21e [2023-11-19 05:01:54,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:01:54,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:01:54,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:01:54,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:01:54,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:01:54,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:01:54" (1/1) ... [2023-11-19 05:01:54,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17bfd7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:54, skipping insertion in model container [2023-11-19 05:01:54,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:01:54" (1/1) ... [2023-11-19 05:01:54,746 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:01:55,075 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_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-19 05:01:55,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:01:55,102 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:01:55,191 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_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-19 05:01:55,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:01:55,235 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:01:55,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55 WrapperNode [2023-11-19 05:01:55,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:01:55,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:01:55,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:01:55,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:01:55,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,289 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2023-11-19 05:01:55,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:01:55,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:01:55,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:01:55,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:01:55,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:01:55,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:01:55,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:01:55,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:01:55,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (1/1) ... [2023-11-19 05:01:55,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:01:55,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:55,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:01:55,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:01:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:01:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:01:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 05:01:55,409 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 05:01:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:01:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:01:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:01:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 05:01:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:01:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:01:55,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 05:01:55,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:01:55,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:01:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:01:55,536 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:01:55,538 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:01:55,783 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:01:55,899 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:01:55,899 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 05:01:55,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:55 BoogieIcfgContainer [2023-11-19 05:01:55,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:01:55,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:01:55,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:01:55,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:01:55,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:01:54" (1/3) ... [2023-11-19 05:01:55,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b5afc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:01:55, skipping insertion in model container [2023-11-19 05:01:55,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:55" (2/3) ... [2023-11-19 05:01:55,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b5afc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:01:55, skipping insertion in model container [2023-11-19 05:01:55,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:55" (3/3) ... [2023-11-19 05:01:55,923 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-11-19 05:01:55,944 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:01:55,944 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 05:01:56,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:01:56,040 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;@4537c522, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:01:56,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 05:01:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-19 05:01:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:01:56,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:56,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:56,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:56,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:56,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1163290619, now seen corresponding path program 1 times [2023-11-19 05:01:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:56,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519886371] [2023-11-19 05:01:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:56,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:56,871 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-19 05:01:56,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:56,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519886371] [2023-11-19 05:01:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519886371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:01:56,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264277005] [2023-11-19 05:01:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:56,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:01:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:56,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:01:56,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:01:56,960 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-19 05:01:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:57,080 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2023-11-19 05:01:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:01:57,083 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-19 05:01:57,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:57,092 INFO L225 Difference]: With dead ends: 45 [2023-11-19 05:01:57,092 INFO L226 Difference]: Without dead ends: 21 [2023-11-19 05:01:57,096 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-19 05:01:57,101 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:57,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-19 05:01:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-11-19 05:01:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-19 05:01:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-11-19 05:01:57,158 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2023-11-19 05:01:57,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:57,160 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-19 05:01:57,161 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-19 05:01:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-11-19 05:01:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:01:57,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:57,165 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-19 05:01:57,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:01:57,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:57,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:57,168 INFO L85 PathProgramCache]: Analyzing trace with hash -54821104, now seen corresponding path program 1 times [2023-11-19 05:01:57,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:57,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348840961] [2023-11-19 05:01:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:57,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:57,490 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-19 05:01:57,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348840961] [2023-11-19 05:01:57,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348840961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:57,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:57,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:01:57,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007308140] [2023-11-19 05:01:57,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:57,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:01:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:57,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:01:57,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:01:57,495 INFO L87 Difference]: Start difference. First operand 19 states and 24 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-19 05:01:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:57,588 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-11-19 05:01:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:01:57,589 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-19 05:01:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:57,590 INFO L225 Difference]: With dead ends: 26 [2023-11-19 05:01:57,590 INFO L226 Difference]: Without dead ends: 20 [2023-11-19 05:01:57,591 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-19 05:01:57,592 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:57,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-19 05:01:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-19 05:01:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-19 05:01:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-19 05:01:57,599 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2023-11-19 05:01:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:57,600 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-19 05:01:57,600 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-19 05:01:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-19 05:01:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 05:01:57,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:57,602 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-19 05:01:57,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:01:57,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:57,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1788563102, now seen corresponding path program 1 times [2023-11-19 05:01:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:57,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257156933] [2023-11-19 05:01:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:00,903 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-19 05:02:00,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:02:00,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257156933] [2023-11-19 05:02:00,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257156933] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:00,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655140114] [2023-11-19 05:02:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:00,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:00,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:02:00,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:02:00,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfe1a56-edb6-46b3-b9e3-afcec8798dbc/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:02:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:01,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-19 05:02:01,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:02:01,571 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-19 05:02:01,849 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-19 05:02:01,968 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 05:02:01,969 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-19 05:02:02,079 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-19 05:02:02,219 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-19 05:02:02,448 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-19 05:02:02,458 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-19 05:02:02,472 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-19 05:02:02,480 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-19 05:02:02,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:02,713 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-19 05:02:02,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:02,732 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-19 05:02:02,759 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-19 05:02:02,759 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-19 05:02:02,773 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-19 05:02:03,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:03,482 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2023-11-19 05:02:03,483 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 76 [2023-11-19 05:02:03,496 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 89 treesize of output 53 [2023-11-19 05:02:03,510 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-19 05:02:03,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:03,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:03,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:03,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-19 05:02:03,560 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-19 05:02:03,703 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-19 05:02:03,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:02:14,044 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0)) (.cse3 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0))) (and (or (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse1 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (and (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_351 Int) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_351)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_49) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not .cse1)) (or (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_351 Int) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_351)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_49) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_54) |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_~last~1#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) .cse1))) (and .cse2 .cse3)) (or (let ((.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse4 (= .cse12 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 (not .cse4) (forall ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_48)) (.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_46))) (or (not (= v_DerPreprocessor_47 (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_11))) (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse7 |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|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_DerPreprocessor_45 (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))) (not .cse8)) (or (and .cse4 .cse8) (let ((.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (and (forall ((v_ArrVal_348 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_348) |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|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_21) (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_15))) (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse10 |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|))) |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_~new_node~0#1.base| (store .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse12)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (or (let ((.cse20 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse13 (not .cse20))) (and (or .cse13 (and (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_33 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) v_DerPreprocessor_12 v_DerPreprocessor_14))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse15 |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_12 .cse14)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse14 v_DerPreprocessor_33) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_34) (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse15 |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|)) |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| (store .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse12)) .cse14 v_DerPreprocessor_35) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse14))))) (forall ((v_DerPreprocessor_12 Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) v_DerPreprocessor_12 v_DerPreprocessor_14))) (let ((.cse16 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse17 |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_12 .cse16)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_37) (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse17 |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|)) |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| (store .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse12)) .cse16 v_DerPreprocessor_38) |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|) 4))) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse16))))))) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) v_DerPreprocessor_12 v_DerPreprocessor_14))) (let ((.cse18 (select (select (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|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |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_40) .cse18 v_DerPreprocessor_41) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_42) (select (select (store .cse19 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse19 |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|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse12)) .cse18 v_DerPreprocessor_43) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_DerPreprocessor_12 .cse18)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse18))))) .cse20) (or (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_34 Int) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) v_DerPreprocessor_12 v_DerPreprocessor_14))) (let ((.cse22 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse23 |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 ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_30) .cse22 v_DerPreprocessor_31) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_32))) (or (not (= v_DerPreprocessor_31 (select .cse21 .cse22))) (not (= v_DerPreprocessor_12 .cse22)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 (select (select (store .cse23 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse23 |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|)) |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_~new_node~0#1.base| (store .cse11 v_prenex_34 .cse12)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse22))))))) .cse20) (or .cse13 (forall ((v_DerPreprocessor_12 Int) (v_prenex_34 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) v_DerPreprocessor_12 v_DerPreprocessor_14))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse24 (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|))) (or (not (= v_DerPreprocessor_7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_7) .cse24 v_DerPreprocessor_8) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (not (= .cse25 v_DerPreprocessor_13)) (not (= v_DerPreprocessor_12 .cse24)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_29) (select (select (store .cse26 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse26 |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|)) |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_~new_node~0#1.base| (store .cse11 v_prenex_34 .cse12)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| .cse24)))))))) (forall ((v_DerPreprocessor_12 Int) (v_prenex_34 Int) (v_prenex_31 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_13) v_DerPreprocessor_12 v_DerPreprocessor_14))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse27 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse28) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse27 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= .cse28 v_DerPreprocessor_13)) (not (= v_DerPreprocessor_12 .cse27)) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_prenex_31) .cse27 v_prenex_33) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_31)) (= |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 .cse29 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse29 |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|)) |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_~new_node~0#1.base| (store .cse11 v_prenex_34 .cse12)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))))) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_348) |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|))) (forall ((v_ArrVal_348 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (let ((.cse30 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse30 |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| .cse30 v_DerPreprocessor_17) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_18) (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| .cse30 v_DerPreprocessor_16))) (store .cse31 |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select .cse31 |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|))) |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| (store .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| .cse12)) .cse30 v_DerPreprocessor_19) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= .cse30 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)))))))))) (not .cse2) (not .cse3)))) is different from false [2023-11-19 05:02:19,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655140114] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:19,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1328469865] [2023-11-19 05:02:19,732 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 05:02:19,733 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:02:19,738 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:02:19,744 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:02:19,745 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:02:21,387 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-19 05:02:21,398 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:02:31,401 WARN L293 SmtUtils]: Spent 6.94s on a formula simplification that was a NOOP. DAG size: 171 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-19 05:02:48,426 WARN L293 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)