./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91 --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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:10:54,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:10:54,746 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:10:54,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:10:54,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:10:54,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:10:54,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:10:54,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:10:54,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:10:54,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:10:54,806 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:10:54,807 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:10:54,807 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:10:54,809 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:10:54,810 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:10:54,810 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:10:54,810 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:10:54,811 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:10:54,811 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:10:54,811 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:10:54,812 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:10:54,812 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:10:54,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:10:54,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:10:54,814 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:10:54,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:10:54,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:10:54,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:10:54,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:10:54,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:10:54,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:10:54,818 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:10:54,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:10:54,818 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:10:54,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:10:54,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:10:54,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:10:54,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:10:54,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:10:54,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:10:54,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:10:54,821 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:10:54,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:10:54,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:10:54,821 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:10:54,822 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:10:54,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:10:54,822 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_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/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_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2023-11-25 00:10:55,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:10:55,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:10:55,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:10:55,161 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:10:55,162 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:10:55,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-25 00:10:58,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:10:58,641 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:10:58,643 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-25 00:10:58,662 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/data/e363c88c4/e406aa2dd6824cd0b005456d4efdafbf/FLAG99938ce15 [2023-11-25 00:10:58,676 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/data/e363c88c4/e406aa2dd6824cd0b005456d4efdafbf [2023-11-25 00:10:58,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:10:58,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:10:58,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:10:58,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:10:58,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:10:58,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:10:58" (1/1) ... [2023-11-25 00:10:58,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f5cac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:58, skipping insertion in model container [2023-11-25 00:10:58,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:10:58" (1/1) ... [2023-11-25 00:10:58,747 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:10:59,135 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_dad24967-f40d-493c-b7f6-de7dc12778aa/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2023-11-25 00:10:59,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:10:59,160 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:10:59,212 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_dad24967-f40d-493c-b7f6-de7dc12778aa/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2023-11-25 00:10:59,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:10:59,248 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:10:59,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59 WrapperNode [2023-11-25 00:10:59,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:10:59,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:10:59,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:10:59,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:10:59,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,304 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2023-11-25 00:10:59,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:10:59,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:10:59,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:10:59,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:10:59,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:10:59,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:10:59,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:10:59,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:10:59,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (1/1) ... [2023-11-25 00:10:59,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:10:59,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:59,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:10:59,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:10:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:10:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:10:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-25 00:10:59,436 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-25 00:10:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:10:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:10:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:10:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-25 00:10:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-25 00:10:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:10:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-25 00:10:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:10:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:10:59,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:10:59,580 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:10:59,582 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:10:59,839 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:10:59,946 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:10:59,954 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-25 00:10:59,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:10:59 BoogieIcfgContainer [2023-11-25 00:10:59,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:10:59,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:10:59,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:10:59,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:10:59,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:10:58" (1/3) ... [2023-11-25 00:10:59,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588804e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:10:59, skipping insertion in model container [2023-11-25 00:10:59,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:59" (2/3) ... [2023-11-25 00:10:59,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588804e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:10:59, skipping insertion in model container [2023-11-25 00:10:59,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:10:59" (3/3) ... [2023-11-25 00:10:59,975 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2023-11-25 00:10:59,992 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:10:59,992 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:11:00,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:11:00,042 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;@702d3eaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:11:00,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:11:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 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-25 00:11:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-25 00:11:00,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:00,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:00,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:11:00,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:00,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1377697261, now seen corresponding path program 1 times [2023-11-25 00:11:00,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:00,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519491812] [2023-11-25 00:11:00,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:00,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:00,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:00,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519491812] [2023-11-25 00:11:00,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519491812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:00,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:11:00,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:11:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429145870] [2023-11-25 00:11:00,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:00,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:11:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:00,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:11:00,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:11:00,551 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:11:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:00,627 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2023-11-25 00:11:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:11:00,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-25 00:11:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:00,639 INFO L225 Difference]: With dead ends: 43 [2023-11-25 00:11:00,639 INFO L226 Difference]: Without dead ends: 21 [2023-11-25 00:11:00,642 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-25 00:11:00,647 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-25 00:11:00,648 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-25 00:11:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-25 00:11:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-11-25 00:11:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-25 00:11:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2023-11-25 00:11:00,691 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 11 [2023-11-25 00:11:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:00,691 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2023-11-25 00:11:00,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:11:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2023-11-25 00:11:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-25 00:11:00,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:00,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:00,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:11:00,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:11:00,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash -4769702, now seen corresponding path program 1 times [2023-11-25 00:11:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:00,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086177609] [2023-11-25 00:11:00,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:00,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:11:01,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:01,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086177609] [2023-11-25 00:11:01,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086177609] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:01,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207847581] [2023-11-25 00:11:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:01,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:01,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:01,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:01,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:11:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:01,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-25 00:11:01,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:11:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:11:01,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:11:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:11:01,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207847581] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:11:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1228438017] [2023-11-25 00:11:01,397 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-25 00:11:01,397 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:11:01,401 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:11:01,413 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:11:01,415 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:11:03,994 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2023-11-25 00:11:04,170 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:11:05,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1228438017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:11:05,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:11:05,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4, 4] total 14 [2023-11-25 00:11:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785881163] [2023-11-25 00:11:05,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:05,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-25 00:11:05,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:05,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-25 00:11:05,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=149, Unknown=2, NotChecked=0, Total=182 [2023-11-25 00:11:05,863 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-25 00:11:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:06,612 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2023-11-25 00:11:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-25 00:11:06,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 17 [2023-11-25 00:11:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:06,615 INFO L225 Difference]: With dead ends: 28 [2023-11-25 00:11:06,615 INFO L226 Difference]: Without dead ends: 20 [2023-11-25 00:11:06,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=37, Invalid=171, Unknown=2, NotChecked=0, Total=210 [2023-11-25 00:11:06,617 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:06,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 3 Unknown, 0 Unchecked, 0.7s Time] [2023-11-25 00:11:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-25 00:11:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-25 00:11:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-25 00:11:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2023-11-25 00:11:06,628 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 17 [2023-11-25 00:11:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:06,629 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2023-11-25 00:11:06,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-25 00:11:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2023-11-25 00:11:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-25 00:11:06,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:06,635 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:06,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:11:06,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:06,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:11:06,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash -245907211, now seen corresponding path program 1 times [2023-11-25 00:11:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:06,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230138726] [2023-11-25 00:11:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:06,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-25 00:11:07,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:07,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230138726] [2023-11-25 00:11:07,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230138726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:07,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599692285] [2023-11-25 00:11:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:07,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:07,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:07,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:07,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:11:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:07,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-25 00:11:07,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:11:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:11:07,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:11:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-25 00:11:07,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599692285] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:11:07,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [621129872] [2023-11-25 00:11:07,243 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-25 00:11:07,243 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:11:07,244 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:11:07,244 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:11:07,244 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:11:09,127 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2023-11-25 00:11:09,263 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:11:13,352 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '401#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (exists ((|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26| Int) (|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~head#1.base_21| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| Int) (|v_#memory_int_99| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| Int) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (<= 2 |v_ULTIMATE.start_sll_insert_~head#1.base_21|) (= |#memory_int| (store |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26| (store (select |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4)))) (= (store |v_#memory_$Pointer$.base_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.base_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4))) |#memory_$Pointer$.base|) (or (and (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| 0))) (= (store |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 4) 0)) |v_#memory_$Pointer$.offset_50|) (= (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|)) |v_#memory_$Pointer$.base_50|) (= |v_#memory_int_50| (store |v_#memory_int_99| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| (store (select |v_#memory_int_99| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 4) (select (select |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 4)))))) (and (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_26| 0) (= |v_#memory_int_50| (store |v_#memory_int_99| |v_ULTIMATE.start_sll_insert_~head#1.base_21| (store (select |v_#memory_int_99| |v_ULTIMATE.start_sll_insert_~head#1.base_21|) 0 (select (select |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~head#1.base_21|) 0)))) (= (store |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_insert_~head#1.base_21| (store (select |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_insert_~head#1.base_21|) 0 0)) |v_#memory_$Pointer$.offset_50|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_26| 0) (= (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_insert_~head#1.base_21| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_insert_~head#1.base_21|) 0 |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|)) |v_#memory_$Pointer$.base_50|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26| (store (select |v_#memory_$Pointer$.offset_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_26|) 4)))))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-25 00:11:13,352 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:11:13,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:11:13,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-25 00:11:13,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555152451] [2023-11-25 00:11:13,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:11:13,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:11:13,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:13,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:11:13,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2023-11-25 00:11:13,355 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-25 00:11:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:13,404 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2023-11-25 00:11:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:11:13,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2023-11-25 00:11:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:13,406 INFO L225 Difference]: With dead ends: 38 [2023-11-25 00:11:13,406 INFO L226 Difference]: Without dead ends: 23 [2023-11-25 00:11:13,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2023-11-25 00:11:13,408 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:13,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:11:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-25 00:11:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-25 00:11:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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-25 00:11:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2023-11-25 00:11:13,417 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 18 [2023-11-25 00:11:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:13,417 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2023-11-25 00:11:13,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-25 00:11:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2023-11-25 00:11:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-25 00:11:13,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:13,419 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:13,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:11:13,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:13,625 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:11:13,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash 617430222, now seen corresponding path program 2 times [2023-11-25 00:11:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:13,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624349903] [2023-11-25 00:11:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:13,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:11:15,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:15,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624349903] [2023-11-25 00:11:15,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624349903] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:15,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37422874] [2023-11-25 00:11:15,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:11:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:15,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:15,637 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:15,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:11:16,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-25 00:11:16,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:11:16,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-25 00:11:16,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:11:16,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:11:16,241 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-25 00:11:16,361 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 23 treesize of output 11 [2023-11-25 00:11:16,558 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 38 treesize of output 22 [2023-11-25 00:11:16,565 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-25 00:11:16,578 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-25 00:11:16,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-25 00:11:16,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:16,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:11:16,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:16,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2023-11-25 00:11:16,735 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-25 00:11:16,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-25 00:11:16,749 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-25 00:11:17,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:17,169 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2023-11-25 00:11:17,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 78 [2023-11-25 00:11:17,179 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 91 treesize of output 55 [2023-11-25 00:11:17,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:17,195 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 26 treesize of output 28 [2023-11-25 00:11:17,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:17,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:17,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:17,220 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-25 00:11:17,225 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-25 00:11:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:11:17,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:11:17,696 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|))) (and (or (not .cse0) (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_378) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_377) |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_insert_~head#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< 0 |c_ULTIMATE.start_sll_insert_~last~0#1.offset|)) (forall ((|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse1 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| 4) v_DerPreprocessor_7)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_378) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_377) |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_insert_~last~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| |c_ULTIMATE.start_sll_insert_~last~0#1.offset|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| 0))) (or .cse0 (forall ((|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse1 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| 4) v_DerPreprocessor_7)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_378) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_377) |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_insert_~last~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_28| |c_ULTIMATE.start_sll_insert_~last~0#1.offset|)))))) is different from false [2023-11-25 00:11:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37422874] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:18,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1636339111] [2023-11-25 00:11:18,619 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-25 00:11:18,619 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:11:18,620 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:11:18,620 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:11:18,620 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:11:20,277 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 97 for LOIs [2023-11-25 00:11:20,521 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:11:25,396 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '622#(and (exists ((|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~head#1.base_23| Int) (|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29| Int) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~head#1.offset_22| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| Int) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (or (and (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| 0) (= (store |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_sll_insert_~head#1.base_23| (store (select |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) |v_ULTIMATE.start_sll_insert_~head#1.offset_22| 0)) |v_#memory_$Pointer$.offset_50|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 0) (= |v_#memory_$Pointer$.base_50| (store |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_insert_~head#1.base_23| (store (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) |v_ULTIMATE.start_sll_insert_~head#1.offset_22| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29|))) (= |v_#memory_int_50| (store |v_#memory_int_127| |v_ULTIMATE.start_sll_insert_~head#1.base_23| (store (select |v_#memory_int_127| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) |v_ULTIMATE.start_sll_insert_~head#1.offset_22| (select (select |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~head#1.base_23|) |v_ULTIMATE.start_sll_insert_~head#1.offset_22|))))) (and (= (store |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) 0)) |v_#memory_$Pointer$.offset_50|) (= |v_#memory_int_50| (store |v_#memory_int_127| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_int_127| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) (select (select |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4))))) (= (store |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| (store (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29|)) |v_#memory_$Pointer$.base_50|) (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_32| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_32| 0))))) (= (store |v_#memory_$Pointer$.base_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29| (store (select |v_#memory_$Pointer$.base_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29|) 4))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29| (store (select |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29|) 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29| (store (select |v_#memory_$Pointer$.offset_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_29|) 4)))))) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_main_~count~0#1| 0) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (not (= |ULTIMATE.start_main_~mid_index~0#1| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|))' at error location [2023-11-25 00:11:25,396 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:11:25,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:11:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-11-25 00:11:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305334547] [2023-11-25 00:11:25,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:11:25,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-25 00:11:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-25 00:11:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1504, Unknown=33, NotChecked=78, Total=1722 [2023-11-25 00:11:25,401 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:11:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:26,719 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2023-11-25 00:11:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-25 00:11:26,720 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-11-25 00:11:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:26,721 INFO L225 Difference]: With dead ends: 31 [2023-11-25 00:11:26,721 INFO L226 Difference]: Without dead ends: 29 [2023-11-25 00:11:26,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=146, Invalid=2076, Unknown=38, NotChecked=92, Total=2352 [2023-11-25 00:11:26,724 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:26,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 135 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-25 00:11:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-25 00:11:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-11-25 00:11:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:11:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2023-11-25 00:11:26,736 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 24 [2023-11-25 00:11:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:26,737 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2023-11-25 00:11:26,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:11:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2023-11-25 00:11:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-25 00:11:26,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:26,738 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:26,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:11:26,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:26,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:11:26,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:26,943 INFO L85 PathProgramCache]: Analyzing trace with hash 617509303, now seen corresponding path program 1 times [2023-11-25 00:11:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909084765] [2023-11-25 00:11:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:11:27,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:27,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909084765] [2023-11-25 00:11:27,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909084765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:27,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236433415] [2023-11-25 00:11:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:27,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:27,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:27,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:27,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-25 00:11:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:28,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-25 00:11:28,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:11:28,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-25 00:11:28,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:28,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-25 00:11:28,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:28,533 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2023-11-25 00:11:28,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 30 [2023-11-25 00:11:28,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 25 treesize of output 13 [2023-11-25 00:11:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:11:28,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:11:28,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:11:28,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 81 [2023-11-25 00:11:28,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:11:28,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 75 [2023-11-25 00:11:29,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236433415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:29,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1186586552] [2023-11-25 00:11:29,102 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-25 00:11:29,102 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:11:29,102 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:11:29,103 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:11:29,103 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:11:30,707 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2023-11-25 00:11:30,808 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:11:35,419 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '849#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (exists ((|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int))) (|v_#memory_int_147| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_37| Int) (|v_ULTIMATE.start_sll_insert_~head#1.base_25| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_37| Int) (|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_122| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32| Int) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32| (store (select |v_#memory_$Pointer$.base_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32| (store (select |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4 (select (select |#memory_int| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32| (store (select |v_#memory_$Pointer$.offset_50| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|) 4)))) (or (and (= |v_#memory_$Pointer$.offset_50| (store |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_sll_insert_~head#1.base_25| (store (select |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_sll_insert_~head#1.base_25|) 0 0))) (= |v_#memory_int_50| (store |v_#memory_int_147| |v_ULTIMATE.start_sll_insert_~head#1.base_25| (store (select |v_#memory_int_147| |v_ULTIMATE.start_sll_insert_~head#1.base_25|) 0 (select (select |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~head#1.base_25|) 0)))) (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_sll_insert_~head#1.base_25| (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_sll_insert_~head#1.base_25|) 0 |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|)) |v_#memory_$Pointer$.base_50|) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_37| 0) (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_37| 0)) (and (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_37| (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_37|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_37| 4) |v_ULTIMATE.start_sll_insert_~new_node~0#1.base_32|)) |v_#memory_$Pointer$.base_50|) (= |v_#memory_int_50| (store |v_#memory_int_147| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_37| (store (select |v_#memory_int_147| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_37|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_37| 4) (select (select |v_#memory_int_50| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_37|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_37| 4))))) (or (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_37| 0)) (not (= |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_37| 0))) (= (store |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_37| (store (select |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base_37|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_37| 4) 0)) |v_#memory_$Pointer$.offset_50|))) (<= 2 |v_ULTIMATE.start_sll_insert_~head#1.base_25|))) (not (= 5 (select (select |#memory_int| 0) 0))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-25 00:11:35,419 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:11:35,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:11:35,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2023-11-25 00:11:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721670055] [2023-11-25 00:11:35,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:11:35,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-25 00:11:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:35,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-25 00:11:35,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1444, Unknown=7, NotChecked=0, Total=1560 [2023-11-25 00:11:35,422 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:11:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:36,418 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2023-11-25 00:11:36,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-25 00:11:36,419 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-11-25 00:11:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:36,420 INFO L225 Difference]: With dead ends: 32 [2023-11-25 00:11:36,420 INFO L226 Difference]: Without dead ends: 26 [2023-11-25 00:11:36,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=166, Invalid=1989, Unknown=7, NotChecked=0, Total=2162 [2023-11-25 00:11:36,423 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:36,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 169 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-25 00:11:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-25 00:11:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-25 00:11:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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-25 00:11:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-11-25 00:11:36,436 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 24 [2023-11-25 00:11:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:36,436 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-11-25 00:11:36,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:11:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-11-25 00:11:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-25 00:11:36,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:36,438 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:36,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-25 00:11:36,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:36,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:11:36,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1862421249, now seen corresponding path program 3 times [2023-11-25 00:11:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:36,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596603830] [2023-11-25 00:11:36,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:36,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-25 00:11:36,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:36,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596603830] [2023-11-25 00:11:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596603830] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177344504] [2023-11-25 00:11:36,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-25 00:11:36,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:36,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:36,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:36,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-25 00:11:37,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-25 00:11:37,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:11:37,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-25 00:11:37,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:11:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-25 00:11:37,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:11:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-25 00:11:37,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177344504] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:37,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:11:37,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 11 [2023-11-25 00:11:37,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190369815] [2023-11-25 00:11:37,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:11:37,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:11:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:11:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:11:37,633 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-25 00:11:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:37,708 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-25 00:11:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-25 00:11:37,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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) Word has length 25 [2023-11-25 00:11:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:37,709 INFO L225 Difference]: With dead ends: 34 [2023-11-25 00:11:37,709 INFO L226 Difference]: Without dead ends: 25 [2023-11-25 00:11:37,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-25 00:11:37,712 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:37,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 34 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:11:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-25 00:11:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-25 00:11:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 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-25 00:11:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-25 00:11:37,729 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 25 [2023-11-25 00:11:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:37,729 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-25 00:11:37,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-25 00:11:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-25 00:11:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-25 00:11:37,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:37,731 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:37,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-25 00:11:37,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-25 00:11:37,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:11:37,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:37,938 INFO L85 PathProgramCache]: Analyzing trace with hash 644968873, now seen corresponding path program 1 times [2023-11-25 00:11:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:37,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562169990] [2023-11-25 00:11:37,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:37,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-25 00:11:38,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562169990] [2023-11-25 00:11:38,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562169990] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818281047] [2023-11-25 00:11:38,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:38,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:38,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:38,274 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:38,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-25 00:11:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:38,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-25 00:11:38,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:11:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-25 00:11:38,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:11:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-25 00:11:38,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818281047] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:11:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1156960270] [2023-11-25 00:11:38,594 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-25 00:11:38,594 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:11:38,595 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:11:38,595 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:11:38,595 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:11:40,114 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2023-11-25 00:11:40,227 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:11:41,676 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1369#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~count~0#1| 1)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-25 00:11:41,676 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:11:41,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:11:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2023-11-25 00:11:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990326877] [2023-11-25 00:11:41,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:11:41,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-25 00:11:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:41,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-25 00:11:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=543, Unknown=1, NotChecked=0, Total=650 [2023-11-25 00:11:41,678 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:11:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:41,924 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-11-25 00:11:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-25 00:11:41,925 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-25 00:11:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:41,925 INFO L225 Difference]: With dead ends: 34 [2023-11-25 00:11:41,926 INFO L226 Difference]: Without dead ends: 26 [2023-11-25 00:11:41,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=163, Invalid=765, Unknown=2, NotChecked=0, Total=930 [2023-11-25 00:11:41,927 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:41,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 67 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:11:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-25 00:11:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-25 00:11:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-25 00:11:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-11-25 00:11:41,938 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 26 [2023-11-25 00:11:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:41,938 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-11-25 00:11:41,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:11:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-11-25 00:11:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-25 00:11:41,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:41,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:41,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-25 00:11:42,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-25 00:11:42,147 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:11:42,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash 645047954, now seen corresponding path program 1 times [2023-11-25 00:11:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:42,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152157306] [2023-11-25 00:11:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:11:43,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:11:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152157306] [2023-11-25 00:11:43,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152157306] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506057236] [2023-11-25 00:11:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:43,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:11:43,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:11:43,895 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:11:43,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dad24967-f40d-493c-b7f6-de7dc12778aa/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-25 00:11:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:11:44,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-25 00:11:44,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:11:44,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:11:44,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-25 00:11:44,430 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-25 00:11:44,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-25 00:11:44,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:11:44,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:44,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:11:44,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:44,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-25 00:11:44,581 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-25 00:11:44,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-25 00:11:44,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2023-11-25 00:11:44,927 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-25 00:11:44,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 122 [2023-11-25 00:11:44,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:44,942 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 62 treesize of output 43 [2023-11-25 00:11:44,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:44,950 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 0 case distinctions, treesize of input 48 treesize of output 46 [2023-11-25 00:11:44,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:44,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:44,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-11-25 00:11:44,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2023-11-25 00:11:45,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:11:45,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 39 [2023-11-25 00:11:45,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:11:45,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-25 00:11:45,177 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-25 00:11:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:11:45,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:11:45,376 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0)) (.cse5 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (and (or (forall ((v_ArrVal_964 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_19))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_958)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_964))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_959) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) (not (= v_ArrVal_959 (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_959 .cse5))))))) (not .cse6) (not .cse7)) (or (and .cse7 .cse6) (forall ((v_ArrVal_964 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_20))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse13 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_958)) (.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_964))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (+ (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_959) (select (select .cse9 .cse10) .cse11)) (select (select .cse12 .cse10) .cse11)))))) (not (= v_ArrVal_959 (store (select .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_959 .cse5)))))))))) is different from false [2023-11-25 00:11:45,419 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| 0)) (.cse1 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 0)) (.cse7 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (and (or (not .cse0) (not .cse1) (forall ((v_ArrVal_964 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_19))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_958)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_964))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_959) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (= v_ArrVal_959 (store (select .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_959 .cse7)))))))) (or (and .cse0 .cse1) (forall ((v_ArrVal_964 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_20))) (or (not (= v_ArrVal_959 (store (select .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_959 .cse7)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse13 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_958)) (.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_964))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (+ (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_959) (select (select .cse9 .cse10) .cse11)) (select (select .cse12 .cse10) .cse11)))))))))))) is different from false [2023-11-25 00:11:45,465 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse8 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse9 (= .cse7 0)) (.cse10 (= .cse5 0))) (and (or (forall ((v_ArrVal_964 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| .cse5 v_DerPreprocessor_20))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse6 (+ .cse7 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_958)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_964))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_959) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))) (not (= v_ArrVal_959 (store (select .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 (select v_ArrVal_959 .cse8))))))) (and .cse9 .cse10)) (or (forall ((v_ArrVal_964 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_19))) (or (not (= v_ArrVal_959 (store (select .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse8 (select v_ArrVal_959 .cse8)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse15 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_958)) (.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_964))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_959) (select (select .cse12 .cse13) .cse14)) (select (select .cse15 .cse13) .cse14)))))))) (not .cse9) (not .cse10))))) is different from false [2023-11-25 00:11:45,953 INFO L349 Elim1Store]: treesize reduction 658, result has 60.3 percent of original size [2023-11-25 00:11:45,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2418 treesize of output 3010 [2023-11-25 00:11:46,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:11:46,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2314 treesize of output 2485 [2023-11-25 00:11:46,126 INFO L349 Elim1Store]: treesize reduction 76, result has 52.5 percent of original size [2023-11-25 00:11:46,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1637 treesize of output 1682 [2023-11-25 00:11:46,253 INFO L349 Elim1Store]: treesize reduction 262, result has 50.8 percent of original size [2023-11-25 00:11:46,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1598 treesize of output 1736