./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 e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:33:48,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:33:48,914 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-06 20:33:48,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:33:48,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:33:48,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:33:48,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:33:48,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:33:48,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:33:48,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:33:48,982 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:33:48,983 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:33:48,983 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:33:48,985 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:33:48,986 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:33:48,986 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:33:48,986 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:33:48,987 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:33:48,987 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:33:48,988 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:33:48,988 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:33:48,989 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:33:48,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:33:48,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 20:33:48,993 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:33:48,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:33:48,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:33:48,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:33:48,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 20:33:48,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:33:48,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 20:33:48,998 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:33:48,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 20:33:48,998 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:33:48,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:33:48,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:33:48,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:33:48,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:33:49,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:33:49,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 20:33:49,001 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:33:49,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:33:49,002 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 20:33:49,002 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:33:49,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:33:49,003 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_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/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_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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-06 20:33:49,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:33:49,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:33:49,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:33:49,378 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:33:49,378 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:33:49,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-06 20:33:52,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:33:52,971 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:33:52,972 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-06 20:33:52,998 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/data/554bb731b/7c9fa71a83e34043be367b06330b9565/FLAG6238af40f [2023-11-06 20:33:53,021 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/data/554bb731b/7c9fa71a83e34043be367b06330b9565 [2023-11-06 20:33:53,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:33:53,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:33:53,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:33:53,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:33:53,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:33:53,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7235dcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53, skipping insertion in model container [2023-11-06 20:33:53,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,105 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:33:53,507 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_435acfb6-0569-4d26-95f2-4ea13df96521/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-06 20:33:53,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:33:53,522 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:33:53,588 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_435acfb6-0569-4d26-95f2-4ea13df96521/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-11-06 20:33:53,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:33:53,633 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:33:53,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53 WrapperNode [2023-11-06 20:33:53,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:33:53,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:33:53,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:33:53,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:33:53,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,720 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 174 [2023-11-06 20:33:53,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:33:53,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:33:53,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:33:53,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:33:53,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:33:53,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:33:53,775 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:33:53,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:33:53,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (1/1) ... [2023-11-06 20:33:53,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:33:53,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:33:53,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:33:53,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:33:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:33:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:33:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 20:33:53,870 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 20:33:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:33:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:33:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:33:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 20:33:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 20:33:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:33:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 20:33:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:33:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:33:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:33:54,068 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:33:54,070 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:33:54,428 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:33:54,518 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:33:54,519 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 20:33:54,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:33:54 BoogieIcfgContainer [2023-11-06 20:33:54,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:33:54,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:33:54,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:33:54,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:33:54,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:33:53" (1/3) ... [2023-11-06 20:33:54,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4b3ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:33:54, skipping insertion in model container [2023-11-06 20:33:54,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:53" (2/3) ... [2023-11-06 20:33:54,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4b3ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:33:54, skipping insertion in model container [2023-11-06 20:33:54,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:33:54" (3/3) ... [2023-11-06 20:33:54,532 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-11-06 20:33:54,595 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:33:54,596 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 20:33:54,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:33:54,678 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a0fd446, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:33:54,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 20:33:54,682 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-06 20:33:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 20:33:54,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:54,692 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:54,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:33:54,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash -165851543, now seen corresponding path program 1 times [2023-11-06 20:33:54,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:54,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522191103] [2023-11-06 20:33:54,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:54,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:55,356 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-06 20:33:55,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:55,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522191103] [2023-11-06 20:33:55,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522191103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:55,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:55,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:33:55,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581882160] [2023-11-06 20:33:55,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:55,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:33:55,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:55,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:33:55,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:33:55,398 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-06 20:33:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:55,500 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2023-11-06 20:33:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:33:55,502 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-06 20:33:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:55,511 INFO L225 Difference]: With dead ends: 55 [2023-11-06 20:33:55,511 INFO L226 Difference]: Without dead ends: 26 [2023-11-06 20:33:55,514 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-06 20:33:55,519 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:55,520 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.1s Time] [2023-11-06 20:33:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-06 20:33:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-06 20:33:55,561 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-06 20:33:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-11-06 20:33:55,564 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2023-11-06 20:33:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:55,565 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-11-06 20:33:55,565 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-06 20:33:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-11-06 20:33:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 20:33:55,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:55,568 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-06 20:33:55,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:33:55,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:33:55,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1569845982, now seen corresponding path program 1 times [2023-11-06 20:33:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:55,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589572933] [2023-11-06 20:33:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:56,070 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-06 20:33:56,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:56,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589572933] [2023-11-06 20:33:56,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589572933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:56,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:33:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159501599] [2023-11-06 20:33:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:56,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:33:56,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:56,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:33:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:33:56,078 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-06 20:33:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:56,167 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2023-11-06 20:33:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:33:56,168 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-06 20:33:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:56,169 INFO L225 Difference]: With dead ends: 36 [2023-11-06 20:33:56,169 INFO L226 Difference]: Without dead ends: 25 [2023-11-06 20:33:56,175 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-06 20:33:56,178 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:56,179 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.1s Time] [2023-11-06 20:33:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-06 20:33:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-06 20:33:56,191 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-06 20:33:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-11-06 20:33:56,193 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 22 [2023-11-06 20:33:56,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:56,194 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-11-06 20:33:56,195 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-06 20:33:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-11-06 20:33:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 20:33:56,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:56,197 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-06 20:33:56,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:33:56,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:33:56,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1308238578, now seen corresponding path program 1 times [2023-11-06 20:33:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:56,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522713147] [2023-11-06 20:33:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:56,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:59,863 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-06 20:33:59,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522713147] [2023-11-06 20:33:59,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522713147] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:33:59,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444519504] [2023-11-06 20:33:59,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:59,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:33:59,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:33:59,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:33:59,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_435acfb6-0569-4d26-95f2-4ea13df96521/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:34:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:34:00,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 131 conjunts are in the unsatisfiable core [2023-11-06 20:34:00,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:34:00,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 20:34:00,618 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 20:34:00,780 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 20:34:00,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 20:34:01,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 20:34:01,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 20:34:01,315 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-06 20:34:01,316 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-06 20:34:01,489 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-06 20:34:01,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-06 20:34:01,742 INFO L322 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-06 20:34:01,742 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 59 [2023-11-06 20:34:01,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-11-06 20:34:01,934 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 20:34:01,935 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 37 [2023-11-06 20:34:01,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 20:34:01,956 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 20:34:02,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:34:02,198 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 20:34:02,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:34:02,243 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 20:34:02,244 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 59 [2023-11-06 20:34:02,274 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 20:34:02,275 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-06 20:34:02,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:34:02,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:34:02,332 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 20:34:02,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-06 20:34:03,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:34:03,036 INFO L322 Elim1Store]: treesize reduction 47, result has 17.5 percent of original size [2023-11-06 20:34:03,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 97 [2023-11-06 20:34:03,050 INFO L351 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 104 treesize of output 60 [2023-11-06 20:34:03,067 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-06 20:34:03,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:34:03,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 20:34:03,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-06 20:34:03,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-06 20:34:03,121 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 20:34:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 20:34:03,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:34:08,749 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| 0)) (.cse4 (= |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 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse2 (= |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_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_22 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 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_DerPreprocessor_19)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_21) (select (select (store |c_#memory_$Pointer$.base| |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|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |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|) 4)))) (not .cse2)) (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_23 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int) (v_DerPreprocessor_24 (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_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_~last~1#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_24) |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| (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |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|) 4)))) .cse2))) (and .cse3 .cse4)) (or (not .cse3) (not .cse4) (let ((.cse5 (= (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)) (.cse11 (= (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 .cse5) (and (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |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 (not (= v_DerPreprocessor_82 (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_85 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_85))) (or (not (= v_DerPreprocessor_84 (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (forall ((v_DerPreprocessor_87 (Array Int Int)) (v_DerPreprocessor_88 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_88))) (or (not (= v_DerPreprocessor_87 (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))))))) (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |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 (not (= v_DerPreprocessor_82 (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_85 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_85))) (or (forall ((v_DerPreprocessor_86 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (= v_DerPreprocessor_84 (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))))))) (not .cse11)) (or (and .cse5 .cse11) (and (forall ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= .cse12 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (select (store (store |c_#memory_int| .cse12 v_DerPreprocessor_80) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_81) (select (select (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_78) |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|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse12 v_DerPreprocessor_76) |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)) |c_ULTIMATE.start_main_~data~0#1|) (not (= .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))))) (or (let ((.cse28 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse22 (not .cse28))) (and (or (and (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse15) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_37) .cse13 v_DerPreprocessor_38) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_39))) (or (not (= .cse13 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_9) .cse13 v_DerPreprocessor_10) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_9)) (not (= v_DerPreprocessor_38 (select .cse14 .cse13))) (= |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_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_37)) (not (= .cse15 v_DerPreprocessor_16))))))) (forall ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse17 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse18) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse16 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_33) .cse17 v_DerPreprocessor_34) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_35))) (or (not (= v_DerPreprocessor_34 (select .cse16 .cse17))) (not (= .cse17 |c_ULTIMATE.start_sll_circular_insert_~head#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_36) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_DerPreprocessor_33 (select .cse16 |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_prenex_19) .cse17 v_prenex_18) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_19)) (not (= .cse18 v_DerPreprocessor_16))))))) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_15 v_DerPreprocessor_25) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_26))) (let ((.cse20 (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_16) v_DerPreprocessor_15 (select .cse21 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 ((.cse19 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_29) .cse20 v_DerPreprocessor_30) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_31))) (or (= v_DerPreprocessor_15 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= v_DerPreprocessor_29 (select .cse19 |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| .cse20 v_DerPreprocessor_27) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_28) (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse20 v_DerPreprocessor_15)))))))) .cse22) (or (and (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_15 Int) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_48) v_DerPreprocessor_15 v_DerPreprocessor_49) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_50))) (let ((.cse23 (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 .cse24 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) v_DerPreprocessor_15 (select .cse24 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|))) (or (= v_DerPreprocessor_15 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_51) .cse23 v_DerPreprocessor_52) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_53) (select (select .cse24 |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| v_DerPreprocessor_54) .cse23 v_DerPreprocessor_55) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (not (= .cse23 v_DerPreprocessor_15)) (= v_DerPreprocessor_15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))))) (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_42))) (let ((.cse26 (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 .cse27 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_17) |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 ((.cse25 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_45) .cse26 v_DerPreprocessor_46) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_47))) (or (not (= v_DerPreprocessor_46 (select .cse25 .cse26))) (not (= .cse26 |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_43) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_44) (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) .cse28) (or (forall ((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_prenex_17 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_58))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select .cse30 |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 |c_#memory_int| .cse32 v_DerPreprocessor_59) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_60)) (.cse31 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_61) .cse32 v_DerPreprocessor_62) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_63))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse32 |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_prenex_17) .cse32 (select .cse29 .cse32)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_17)) (not (= v_DerPreprocessor_61 (select .cse31 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))))))) .cse28) (or (and (forall ((v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_70 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_70) .cse34 v_DerPreprocessor_71) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_72))) (or (not (= v_DerPreprocessor_71 (select .cse33 .cse34))) (not (= (select .cse33 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_70)) (not (= .cse34 |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_69) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_64) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse33 |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_DerPreprocessor_9) .cse34 v_DerPreprocessor_10) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_DerPreprocessor_9)))))) (forall ((v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int)) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_66 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_68 (Array Int Int))) (let ((.cse36 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse35 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_DerPreprocessor_65) .cse36 v_DerPreprocessor_66) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_67))) (or (not (= v_DerPreprocessor_65 (select .cse35 |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_68) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_64) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_DerPreprocessor_66 (select .cse35 .cse36))) (not (= .cse36 |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_prenex_19) .cse36 v_prenex_18) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) v_prenex_19))))))) .cse22)))) (forall ((v_ArrVal_341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_341) |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|))) (or (forall ((v_ArrVal_341 (Array Int Int))) (let ((.cse37 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= .cse37 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (not (= .cse37 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))))) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_74) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_73) |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_~head#1.base| v_DerPreprocessor_75) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)))))))))) is different from false [2023-11-06 20:34:08,962 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse5 (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 ((.cse0 (= .cse5 0)) (.cse1 (= .cse3 0))) (and (or (and .cse0 .cse1) (let ((.cse4 (select |c_#memory_int| .cse3)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse2 (= .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (and (or (not .cse2) (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_22 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse3 (store .cse4 .cse5 v_DerPreprocessor_19)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_21) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store .cse6 .cse5 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_23 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse3 (store .cse4 .cse5 v_DerPreprocessor_19)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_21) (select (select (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_23) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store .cse6 .cse5 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) .cse2)))) (or (not .cse0) (and (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_83))) (or (not (= v_DerPreprocessor_82 (select .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_85 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_85))) (or (not (= v_DerPreprocessor_84 (select .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (forall ((v_DerPreprocessor_87 (Array Int Int)) (v_DerPreprocessor_88 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_88))) (or (not (= v_DerPreprocessor_87 (select .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (= (select (select .cse7 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)))))))))) (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_83))) (or (not (= v_DerPreprocessor_82 (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (forall ((v_DerPreprocessor_84 (Array Int Int)) (v_DerPreprocessor_85 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_DerPreprocessor_84) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_85))) (or (not (= v_DerPreprocessor_84 (select .cse11 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (forall ((v_DerPreprocessor_86 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_DerPreprocessor_86) |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))))))))))) (not .cse1))))) is different from false [2023-11-06 20:34:12,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444519504] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:34:12,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1801938548] [2023-11-06 20:34:12,569 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-06 20:34:12,569 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:34:12,577 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:34:12,583 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:34:12,584 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:34:14,053 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-06 20:34:14,067 INFO L180 IcfgInterpreter]: Interpretation finished