./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:35:05,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:35:05,974 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-06 20:35:05,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:35:05,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:35:06,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:35:06,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:35:06,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:35:06,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:35:06,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:35:06,058 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:35:06,059 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:35:06,060 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:35:06,062 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:35:06,062 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:35:06,063 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:35:06,063 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:35:06,064 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:35:06,064 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:35:06,065 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:35:06,065 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:35:06,066 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:35:06,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:35:06,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 20:35:06,068 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:35:06,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:35:06,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:35:06,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:35:06,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 20:35:06,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:35:06,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 20:35:06,073 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:35:06,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 20:35:06,073 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:35:06,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:35:06,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:35:06,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:35:06,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:35:06,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:35:06,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 20:35:06,075 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:35:06,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:35:06,076 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 20:35:06,076 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:35:06,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:35:06,077 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_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2023-11-06 20:35:06,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:35:06,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:35:06,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:35:06,445 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:35:06,446 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:35:06,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-06 20:35:09,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:35:09,945 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:35:09,946 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-06 20:35:09,965 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/data/8767bc6e1/4684d2cc7bf64ff48011f16c7aea3dc6/FLAG1b5650ff3 [2023-11-06 20:35:09,979 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/data/8767bc6e1/4684d2cc7bf64ff48011f16c7aea3dc6 [2023-11-06 20:35:09,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:35:09,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:35:09,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:35:09,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:35:09,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:35:09,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:35:09" (1/1) ... [2023-11-06 20:35:09,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727e0042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:09, skipping insertion in model container [2023-11-06 20:35:09,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:35:09" (1/1) ... [2023-11-06 20:35:10,057 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:35:10,345 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_913afd76-b1e8-4d33-a236-a0b202cfc6f5/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2023-11-06 20:35:10,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:35:10,367 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:35:10,444 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_913afd76-b1e8-4d33-a236-a0b202cfc6f5/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2023-11-06 20:35:10,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:35:10,486 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:35:10,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10 WrapperNode [2023-11-06 20:35:10,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:35:10,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:35:10,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:35:10,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:35:10,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,560 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2023-11-06 20:35:10,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:35:10,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:35:10,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:35:10,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:35:10,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:35:10,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:35:10,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:35:10,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:35:10,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (1/1) ... [2023-11-06 20:35:10,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:35:10,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:35:10,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:35:10,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:35:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:35:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:35:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 20:35:10,718 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 20:35:10,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:35:10,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:35:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:35:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 20:35:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 20:35:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:35:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 20:35:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:35:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:35:10,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:35:10,969 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:35:10,983 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:35:11,240 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:35:11,301 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:35:11,309 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 20:35:11,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:35:11 BoogieIcfgContainer [2023-11-06 20:35:11,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:35:11,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:35:11,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:35:11,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:35:11,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:35:09" (1/3) ... [2023-11-06 20:35:11,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e946c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:35:11, skipping insertion in model container [2023-11-06 20:35:11,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:35:10" (2/3) ... [2023-11-06 20:35:11,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e946c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:35:11, skipping insertion in model container [2023-11-06 20:35:11,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:35:11" (3/3) ... [2023-11-06 20:35:11,331 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2023-11-06 20:35:11,351 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:35:11,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 20:35:11,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:35:11,423 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@25103ed6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:35:11,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 20:35:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:35:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:35:11,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:35:11,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:35:11,439 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:35:11,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:35:11,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1235008322, now seen corresponding path program 1 times [2023-11-06 20:35:11,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:35:11,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195056935] [2023-11-06 20:35:11,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:35:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:35:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:35:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:35:11,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:35:11,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195056935] [2023-11-06 20:35:11,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195056935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:35:11,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:35:11,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:35:11,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813165613] [2023-11-06 20:35:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:35:11,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:35:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:35:11,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:35:11,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:35:11,908 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-06 20:35:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:35:11,978 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-11-06 20:35:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:35:11,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2023-11-06 20:35:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:35:11,989 INFO L225 Difference]: With dead ends: 35 [2023-11-06 20:35:11,989 INFO L226 Difference]: Without dead ends: 17 [2023-11-06 20:35:11,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:35:11,996 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:35:11,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:35:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-06 20:35:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2023-11-06 20:35:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:35:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-06 20:35:12,038 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2023-11-06 20:35:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:35:12,038 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-06 20:35:12,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-06 20:35:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-06 20:35:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 20:35:12,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:35:12,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:35:12,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:35:12,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:35:12,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:35:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash -908152313, now seen corresponding path program 1 times [2023-11-06 20:35:12,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:35:12,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098598373] [2023-11-06 20:35:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:35:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:35:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:35:12,295 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-06 20:35:12,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:35:12,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098598373] [2023-11-06 20:35:12,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098598373] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:35:12,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939366608] [2023-11-06 20:35:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:35:12,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:35:12,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:35:12,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:35:12,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:35:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:35:12,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 20:35:12,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:35:12,610 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-06 20:35:12,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:35:12,717 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-06 20:35:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939366608] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:35:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [55987166] [2023-11-06 20:35:12,746 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-06 20:35:12,747 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:35:12,750 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:35:12,756 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:35:12,758 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:35:15,154 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-11-06 20:35:15,443 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:35:22,392 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '194#(and (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_14| Int) (|v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| Int) (|v_#memory_int_19| (Array Int (Array Int Int)))) (and (<= 2 |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|) (= (store (store |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |#memory_$Pointer$.base|) (<= 2 |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) (or (and (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_51| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 8))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_14| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|) (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.base_52|)) (exists ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.offset_52|)) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) (exists ((|v_#memory_int_31| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4))) |v_#memory_int_31|) (= |v_#memory_int_63| (store |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0 1))))) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_62| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_9|)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) |#StackHeapBarrier|)) (and (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_51| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_62| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 8))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_14| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|) (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.base_52|)) (exists ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.offset_52|)) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) (exists ((|v_#memory_int_31| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4))) |v_#memory_int_31|) (= |v_#memory_int_63| (store |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0 1))))) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) |#StackHeapBarrier|))) (= |#memory_int| (store |v_#memory_int_19| |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select |v_#memory_int_19| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)))) (= |v_#memory_int_19| (store |v_#memory_int_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_19| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 0))))) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (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) (= (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-06 20:35:22,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:35:22,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:35:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 20:35:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847790788] [2023-11-06 20:35:22,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:35:22,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:35:22,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:35:22,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:35:22,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2023-11-06 20:35:22,400 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-06 20:35:22,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:35:22,450 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-06 20:35:22,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:35:22,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 16 [2023-11-06 20:35:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:35:22,452 INFO L225 Difference]: With dead ends: 28 [2023-11-06 20:35:22,452 INFO L226 Difference]: Without dead ends: 18 [2023-11-06 20:35:22,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2023-11-06 20:35:22,454 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:35:22,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:35:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-06 20:35:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-06 20:35:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 20:35:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-06 20:35:22,461 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 16 [2023-11-06 20:35:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:35:22,461 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-06 20:35:22,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-06 20:35:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-06 20:35:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 20:35:22,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:35:22,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:35:22,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 20:35:22,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:35:22,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:35:22,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:35:22,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1199292684, now seen corresponding path program 2 times [2023-11-06 20:35:22,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:35:22,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555386243] [2023-11-06 20:35:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:35:22,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:35:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:35:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 20:35:23,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:35:23,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555386243] [2023-11-06 20:35:23,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555386243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:35:23,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:35:23,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 20:35:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218039514] [2023-11-06 20:35:23,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:35:23,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 20:35:23,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:35:23,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 20:35:23,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:35:23,664 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:35:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:35:23,854 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-11-06 20:35:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 20:35:23,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-06 20:35:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:35:23,858 INFO L225 Difference]: With dead ends: 25 [2023-11-06 20:35:23,859 INFO L226 Difference]: Without dead ends: 23 [2023-11-06 20:35:23,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-06 20:35:23,860 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:35:23,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:35:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-06 20:35:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-06 20:35:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 20:35:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-06 20:35:23,872 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2023-11-06 20:35:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:35:23,872 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-06 20:35:23,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:35:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-06 20:35:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 20:35:23,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:35:23,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:35:23,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:35:23,876 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:35:23,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:35:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1199347709, now seen corresponding path program 1 times [2023-11-06 20:35:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:35:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141882129] [2023-11-06 20:35:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:35:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:35:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:35:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 20:35:24,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:35:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141882129] [2023-11-06 20:35:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141882129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:35:24,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:35:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 20:35:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329614624] [2023-11-06 20:35:24,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:35:24,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:35:24,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:35:24,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:35:24,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:35:24,242 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:35:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:35:24,305 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-11-06 20:35:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:35:24,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-06 20:35:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:35:24,307 INFO L225 Difference]: With dead ends: 23 [2023-11-06 20:35:24,307 INFO L226 Difference]: Without dead ends: 20 [2023-11-06 20:35:24,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 20:35:24,308 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:35:24,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:35:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-06 20:35:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-06 20:35:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 20:35:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-06 20:35:24,315 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 22 [2023-11-06 20:35:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:35:24,316 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-06 20:35:24,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:35:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-06 20:35:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 20:35:24,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:35:24,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:35:24,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:35:24,318 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:35:24,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:35:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1469067847, now seen corresponding path program 1 times [2023-11-06 20:35:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:35:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76963861] [2023-11-06 20:35:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:35:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:35:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:35:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:35:26,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:35:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76963861] [2023-11-06 20:35:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76963861] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:35:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060752587] [2023-11-06 20:35:26,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:35:26,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:35:26,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:35:26,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:35:26,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 20:35:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:35:26,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-06 20:35:26,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:35:26,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 20:35:26,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 20:35:26,848 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 20:35:27,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-06 20:35:27,056 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 20:35:27,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 20:35:27,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 20:35:27,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:35:27,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-11-06 20:35:27,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:35:27,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2023-11-06 20:35:27,271 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 20:35:27,271 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 20:35:27,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 20:35:27,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:35:27,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:35:27,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-06 20:35:27,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:35:27,470 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 25 [2023-11-06 20:35:27,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:35:27,488 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 35 [2023-11-06 20:35:27,655 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:35:27,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 35 [2023-11-06 20:35:27,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:35:27,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 20:35:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:35:27,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:35:29,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060752587] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:35:29,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1187998865] [2023-11-06 20:35:29,196 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-06 20:35:29,196 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:35:29,196 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:35:29,196 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:35:29,197 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:35:30,579 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-11-06 20:35:30,841 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:35:35,049 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '551#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (= |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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-06 20:35:35,049 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:35:35,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 20:35:35,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-11-06 20:35:35,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484626689] [2023-11-06 20:35:35,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 20:35:35,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 20:35:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:35:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 20:35:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1525, Unknown=6, NotChecked=0, Total=1640 [2023-11-06 20:35:35,052 INFO L87 Difference]: Start difference. First operand 20 states and 24 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-06 20:35:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:35:35,999 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-11-06 20:35:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 20:35:35,999 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-06 20:35:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:35:36,000 INFO L225 Difference]: With dead ends: 27 [2023-11-06 20:35:36,000 INFO L226 Difference]: Without dead ends: 25 [2023-11-06 20:35:36,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=148, Invalid=2007, Unknown=7, NotChecked=0, Total=2162 [2023-11-06 20:35:36,003 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 20:35:36,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 88 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 20:35:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-06 20:35:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-11-06 20:35:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 20:35:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-11-06 20:35:36,010 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 24 [2023-11-06 20:35:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:35:36,011 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-11-06 20:35:36,011 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-06 20:35:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-11-06 20:35:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 20:35:36,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:35:36,012 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:35:36,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 20:35:36,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:35:36,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 20:35:36,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:35:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1469122872, now seen corresponding path program 1 times [2023-11-06 20:35:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:35:36,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491896255] [2023-11-06 20:35:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:35:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:35:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:35:37,074 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-06 20:35:37,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:35:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491896255] [2023-11-06 20:35:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491896255] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:35:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615641289] [2023-11-06 20:35:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:35:37,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:35:37,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:35:37,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:35:37,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_913afd76-b1e8-4d33-a236-a0b202cfc6f5/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 20:35:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:35:37,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-06 20:35:37,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:35:37,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-06 20:35:37,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:35:37,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 20:35:37,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:35:37,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 16 [2023-11-06 20:35:37,622 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:35:37,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2023-11-06 20:35:37,628 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-06 20:35:37,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:35:37,677 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 20:35:37,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1194 treesize of output 1193 [2023-11-06 20:35:37,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 972 treesize of output 964 [2023-11-06 20:35:37,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2023-11-06 20:35:37,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2023-11-06 20:35:37,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2023-11-06 20:35:37,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 182 [2023-11-06 20:35:37,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86