./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/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_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:55:45,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:55:45,857 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-06 20:55:45,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:55:45,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:55:45,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:55:45,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:55:45,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:55:45,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:55:45,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:55:45,914 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:55:45,915 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:55:45,915 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:55:45,917 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:55:45,918 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:55:45,918 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:55:45,919 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:55:45,919 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:55:45,920 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:55:45,920 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:55:45,921 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:55:45,921 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:55:45,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 20:55:45,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 20:55:45,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:55:45,924 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:55:45,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:55:45,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:55:45,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:55:45,926 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 20:55:45,928 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 20:55:45,928 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 20:55:45,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:55:45,929 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 20:55:45,929 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 20:55:45,929 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:55:45,930 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:55:45,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:55:45,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:55:45,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:55:45,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:55:45,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:55:45,932 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:55:45,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:55:45,933 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:55:45,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:55:45,934 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_18472697-dfbb-48c1-bfd3-21844adc1fce/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_18472697-dfbb-48c1-bfd3-21844adc1fce/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2023-11-06 20:55:46,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:55:46,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:55:46,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:55:46,328 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:55:46,329 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:55:46,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-06 20:55:49,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:55:49,694 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:55:49,695 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-06 20:55:49,724 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/data/4bb68fa66/72b5cc05d24e4fd2815f65dbf5281c46/FLAGfba8f0dfc [2023-11-06 20:55:49,742 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/data/4bb68fa66/72b5cc05d24e4fd2815f65dbf5281c46 [2023-11-06 20:55:49,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:55:49,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:55:49,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:55:49,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:55:49,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:55:49,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:55:49" (1/1) ... [2023-11-06 20:55:49,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d01751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:49, skipping insertion in model container [2023-11-06 20:55:49,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:55:49" (1/1) ... [2023-11-06 20:55:49,838 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:55:50,265 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:55:50,279 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:55:50,340 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:55:50,375 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:55:50,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50 WrapperNode [2023-11-06 20:55:50,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:55:50,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:55:50,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:55:50,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:55:50,386 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:55:50" (1/1) ... [2023-11-06 20:55:50,421 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:55:50" (1/1) ... [2023-11-06 20:55:50,461 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 143 [2023-11-06 20:55:50,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:55:50,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:55:50,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:55:50,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:55:50,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50" (1/1) ... [2023-11-06 20:55:50,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50" (1/1) ... [2023-11-06 20:55:50,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50" (1/1) ... [2023-11-06 20:55:50,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50" (1/1) ... [2023-11-06 20:55:50,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50" (1/1) ... [2023-11-06 20:55:50,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50" (1/1) ... [2023-11-06 20:55:50,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50" (1/1) ... [2023-11-06 20:55:50,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50" (1/1) ... [2023-11-06 20:55:50,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:55:50,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:55:50,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:55:50,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:55:50,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50" (1/1) ... [2023-11-06 20:55:50,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:55:50,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:55:50,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/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:55:50,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/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:55:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:55:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:55:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 20:55:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 20:55:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:55:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:55:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:55:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 20:55:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 20:55:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:55:50,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 20:55:50,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:55:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:55:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:55:50,813 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:55:50,816 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:55:51,327 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:55:51,390 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:55:51,390 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 20:55:51,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:55:51 BoogieIcfgContainer [2023-11-06 20:55:51,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:55:51,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:55:51,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:55:51,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:55:51,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:55:49" (1/3) ... [2023-11-06 20:55:51,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f8d809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:55:51, skipping insertion in model container [2023-11-06 20:55:51,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:55:50" (2/3) ... [2023-11-06 20:55:51,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f8d809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:55:51, skipping insertion in model container [2023-11-06 20:55:51,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:55:51" (3/3) ... [2023-11-06 20:55:51,403 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2023-11-06 20:55:51,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:55:51,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-06 20:55:51,485 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:55:51,492 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@17f0a224, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:55:51,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-11-06 20:55:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 41 states have (on average 2.268292682926829) internal successors, (93), 80 states have internal predecessors, (93), 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:55:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:55:51,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:51,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:55:51,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-06 20:55:51,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:51,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2101263940, now seen corresponding path program 1 times [2023-11-06 20:55:51,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:51,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547849133] [2023-11-06 20:55:51,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:51,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:51,850 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:55:51,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547849133] [2023-11-06 20:55:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547849133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:51,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:51,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:55:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069301231] [2023-11-06 20:55:51,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:51,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:55:51,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:51,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:55:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:55:51,892 INFO L87 Difference]: Start difference. First operand has 84 states, 41 states have (on average 2.268292682926829) internal successors, (93), 80 states have internal predecessors, (93), 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 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:51,957 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2023-11-06 20:55:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:55:51,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 20:55:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:51,967 INFO L225 Difference]: With dead ends: 89 [2023-11-06 20:55:51,968 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 20:55:51,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:55:51,973 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:51,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 156 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:55:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 20:55:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2023-11-06 20:55:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 40 states have (on average 2.15) internal successors, (86), 78 states have internal predecessors, (86), 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:55:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-11-06 20:55:52,018 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 6 [2023-11-06 20:55:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:52,019 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-11-06 20:55:52,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-11-06 20:55:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:55:52,020 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:52,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:55:52,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:55:52,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-06 20:55:52,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2018174784, now seen corresponding path program 1 times [2023-11-06 20:55:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:52,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721397093] [2023-11-06 20:55:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:52,120 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:55:52,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:52,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721397093] [2023-11-06 20:55:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721397093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:52,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:55:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753031260] [2023-11-06 20:55:52,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:52,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:55:52,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:52,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:55:52,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:55:52,124 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:52,227 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2023-11-06 20:55:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:55:52,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 20:55:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:52,230 INFO L225 Difference]: With dead ends: 80 [2023-11-06 20:55:52,231 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 20:55:52,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:55:52,239 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:52,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 114 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:55:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 20:55:52,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-06 20:55:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.1) internal successors, (84), 76 states have internal predecessors, (84), 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:55:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-11-06 20:55:52,262 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 6 [2023-11-06 20:55:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:52,263 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-11-06 20:55:52,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-11-06 20:55:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:55:52,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:52,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:55:52,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:55:52,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-06 20:55:52,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2018174785, now seen corresponding path program 1 times [2023-11-06 20:55:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:52,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063143143] [2023-11-06 20:55:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:52,438 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:55:52,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:52,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063143143] [2023-11-06 20:55:52,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063143143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:52,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:52,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:55:52,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053554343] [2023-11-06 20:55:52,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:52,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:55:52,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:52,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:55:52,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:55:52,441 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:52,516 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-11-06 20:55:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:55:52,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 20:55:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:52,518 INFO L225 Difference]: With dead ends: 78 [2023-11-06 20:55:52,518 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 20:55:52,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:55:52,520 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:52,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:55:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 20:55:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-06 20:55:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 40 states have (on average 2.05) internal successors, (82), 74 states have internal predecessors, (82), 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:55:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-06 20:55:52,530 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 6 [2023-11-06 20:55:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:52,530 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-06 20:55:52,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:55:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-06 20:55:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:55:52,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:52,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:52,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:55:52,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-06 20:55:52,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash -28447332, now seen corresponding path program 1 times [2023-11-06 20:55:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:52,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856098815] [2023-11-06 20:55:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:52,703 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:55:52,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856098815] [2023-11-06 20:55:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856098815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:55:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810935832] [2023-11-06 20:55:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:52,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:55:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:52,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:55:52,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:55:52,707 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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:55:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:52,953 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2023-11-06 20:55:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:55:52,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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:55:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:52,956 INFO L225 Difference]: With dead ends: 78 [2023-11-06 20:55:52,956 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 20:55:52,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:55:52,958 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 5 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:52,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 238 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:55:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 20:55:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2023-11-06 20:55:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 2.025) internal successors, (81), 73 states have internal predecessors, (81), 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:55:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2023-11-06 20:55:52,971 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 10 [2023-11-06 20:55:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:52,971 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2023-11-06 20:55:52,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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:55:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2023-11-06 20:55:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:55:52,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:52,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:52,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:55:52,973 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-06 20:55:52,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash -28447331, now seen corresponding path program 1 times [2023-11-06 20:55:52,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:52,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822861936] [2023-11-06 20:55:52,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:52,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:53,194 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:55:53,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:53,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822861936] [2023-11-06 20:55:53,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822861936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:55:53,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:55:53,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:55:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621622024] [2023-11-06 20:55:53,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:55:53,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:55:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:55:53,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:55:53,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:55:53,200 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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:55:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:55:53,425 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-11-06 20:55:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:55:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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:55:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:55:53,428 INFO L225 Difference]: With dead ends: 77 [2023-11-06 20:55:53,428 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 20:55:53,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 20:55:53,430 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:55:53,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 320 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:55:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 20:55:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-11-06 20:55:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 40 states have (on average 2.0) internal successors, (80), 72 states have internal predecessors, (80), 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:55:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2023-11-06 20:55:53,448 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 10 [2023-11-06 20:55:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:55:53,449 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2023-11-06 20:55:53,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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:55:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2023-11-06 20:55:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 20:55:53,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:55:53,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:55:53,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:55:53,451 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-06 20:55:53,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:55:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2131289066, now seen corresponding path program 1 times [2023-11-06 20:55:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:55:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395009285] [2023-11-06 20:55:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:55:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:55:53,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:55:53,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395009285] [2023-11-06 20:55:53,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395009285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:55:53,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108218571] [2023-11-06 20:55:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:55:53,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:55:53,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:55:53,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:55:53,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:55:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:55:53,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 20:55:53,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:55:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:55:53,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:55:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:55:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108218571] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:55:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1140877494] [2023-11-06 20:55:53,904 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-06 20:55:53,904 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:55:53,908 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:55:53,914 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:55:53,915 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:55:56,346 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2023-11-06 20:55:57,066 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:56:03,149 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1021#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (= 5 |ULTIMATE.start_sll_append_#in~data#1|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (or (and (= (select |#valid| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_sll_append_~new_last~0#1.base|)) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_55| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_55| |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|)) (exists ((|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_77| (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_77| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_77| |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_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_79| (Array Int Int))) (= |#length| (store |v_#length_79| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#valid_94| (Array Int Int))) (and (= (select |v_#valid_94| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_94| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int)))) (and (= |v_#memory_int_52| (store |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_52| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_52| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5)))))) (and (= (select |#valid| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_sll_append_~new_last~0#1.base|)) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (= 1 (select |v_old(#valid)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_17| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_79| (Array Int Int))) (= |#length| (store |v_#length_79| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_int_55| (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_55| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_55| |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_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_77| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_77| |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))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_10|) (= (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|))) (exists ((|v_#valid_94| (Array Int Int))) (and (= (select |v_#valid_94| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_94| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int)))) (and (= |v_#memory_int_52| (store |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_52| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_52| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))))))) (<= 2 |ULTIMATE.start_sll_append_~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0))' at error location [2023-11-06 20:56:03,150 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:56:03,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:56:03,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 20:56:03,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694693362] [2023-11-06 20:56:03,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:56:03,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:56:03,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:03,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:56:03,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=230, Unknown=5, NotChecked=0, Total=272 [2023-11-06 20:56:03,153 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:56:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:03,212 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-11-06 20:56:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:56:03,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2023-11-06 20:56:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:03,215 INFO L225 Difference]: With dead ends: 80 [2023-11-06 20:56:03,215 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 20:56:03,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=37, Invalid=230, Unknown=5, NotChecked=0, Total=272 [2023-11-06 20:56:03,217 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:03,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 208 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:56:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 20:56:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-06 20:56:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.930232558139535) internal successors, (83), 75 states have internal predecessors, (83), 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:56:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2023-11-06 20:56:03,225 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 19 [2023-11-06 20:56:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:03,226 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2023-11-06 20:56:03,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:56:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2023-11-06 20:56:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 20:56:03,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:03,227 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:03,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 20:56:03,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:56:03,445 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-06 20:56:03,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 455103834, now seen corresponding path program 2 times [2023-11-06 20:56:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:03,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507654613] [2023-11-06 20:56:03,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:03,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 20:56:04,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507654613] [2023-11-06 20:56:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507654613] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:56:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108104580] [2023-11-06 20:56:04,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 20:56:04,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:56:04,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:56:04,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:56:04,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 20:56:04,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 20:56:04,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 20:56:04,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 20:56:04,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:56:04,355 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:56:04,386 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:56:04,395 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-06 20:56:04,425 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 20:56:04,426 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 20:56:04,465 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:56:04,480 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-06 20:56:04,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:56:04,510 INFO L351 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 14 treesize of output 9 [2023-11-06 20:56:04,544 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 20:56:04,545 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 20:56:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 8 not checked. [2023-11-06 20:56:04,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:56:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108104580] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:56:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1566626987] [2023-11-06 20:56:04,776 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-06 20:56:04,776 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:56:04,776 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:56:04,777 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:56:04,777 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:56:06,253 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2023-11-06 20:56:06,789 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:56:13,452 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1325#(and (<= 1 |#StackHeapBarrier|) (or (and (exists ((|v_#valid_114| (Array Int Int))) (and (= (select |v_#valid_114| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_114| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1)))) (= (select |#valid| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#memory_$Pointer$.offset_93| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_93| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_71| (Array Int (Array Int Int))) (|v_#memory_int_72| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_72| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_72| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_72| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_72|))) (<= 8 (select |#length| |ULTIMATE.start_sll_append_~new_last~0#1.base|)) (exists ((|v_#length_91| (Array Int Int))) (= |#length| (store |v_#length_91| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_int_75| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_97| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_97| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_21|) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#length_BEFORE_CALL_35| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|)))) (and (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_97| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_97| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_20|) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#valid_114| (Array Int Int))) (and (= (select |v_#valid_114| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_114| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1)))) (= (select |#valid| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 1) (exists ((|v_#memory_$Pointer$.offset_93| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_93| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_71| (Array Int (Array Int Int))) (|v_#memory_int_72| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_72| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_72| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_72| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_72|))) (<= 8 (select |#length| |ULTIMATE.start_sll_append_~new_last~0#1.base|)) (exists ((|v_#length_91| (Array Int Int))) (= |#length| (store |v_#length_91| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_93| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#length)_AFTER_CALL_20| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_int_75| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (= 5 |ULTIMATE.start_sll_append_#in~data#1|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 2 |ULTIMATE.start_sll_append_~head#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0))' at error location [2023-11-06 20:56:13,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:56:13,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 20:56:13,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-11-06 20:56:13,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542450227] [2023-11-06 20:56:13,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 20:56:13,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 20:56:13,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:13,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 20:56:13,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=513, Unknown=4, NotChecked=94, Total=702 [2023-11-06 20:56:13,456 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 13 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 20:56:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:13,826 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-11-06 20:56:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:56:13,827 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2023-11-06 20:56:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:13,828 INFO L225 Difference]: With dead ends: 85 [2023-11-06 20:56:13,828 INFO L226 Difference]: Without dead ends: 85 [2023-11-06 20:56:13,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=108, Invalid=598, Unknown=4, NotChecked=102, Total=812 [2023-11-06 20:56:13,830 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:13,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 202 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 170 Unchecked, 0.3s Time] [2023-11-06 20:56:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-06 20:56:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2023-11-06 20:56:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.813953488372093) internal successors, (78), 70 states have internal predecessors, (78), 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:56:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-06 20:56:13,837 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 28 [2023-11-06 20:56:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:13,837 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-06 20:56:13,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 20:56:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-06 20:56:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 20:56:13,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:13,839 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:13,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 20:56:14,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:56:14,045 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-06 20:56:14,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:14,046 INFO L85 PathProgramCache]: Analyzing trace with hash 455103835, now seen corresponding path program 1 times [2023-11-06 20:56:14,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:14,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657685041] [2023-11-06 20:56:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:56:14,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:14,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657685041] [2023-11-06 20:56:14,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657685041] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:56:14,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924175246] [2023-11-06 20:56:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:14,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:56:14,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:56:14,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:56:14,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 20:56:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:15,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 20:56:15,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:56:15,126 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 8 treesize of output 1 [2023-11-06 20:56:15,164 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:56:15,173 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-06 20:56:15,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:56:15,231 INFO L351 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 14 treesize of output 9 [2023-11-06 20:56:15,264 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:56:15,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:56:15,298 INFO L351 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 14 treesize of output 9 [2023-11-06 20:56:15,368 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:56:15,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:56:15,404 INFO L351 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 14 treesize of output 9 [2023-11-06 20:56:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 20:56:15,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:56:15,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924175246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:56:15,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:56:15,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2023-11-06 20:56:15,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815678531] [2023-11-06 20:56:15,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:56:15,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:56:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:56:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:56:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2023-11-06 20:56:15,429 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 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-06 20:56:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:56:15,580 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2023-11-06 20:56:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:56:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 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 28 [2023-11-06 20:56:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:56:15,582 INFO L225 Difference]: With dead ends: 72 [2023-11-06 20:56:15,582 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 20:56:15,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2023-11-06 20:56:15,583 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:56:15,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 189 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 93 Unchecked, 0.1s Time] [2023-11-06 20:56:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 20:56:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-06 20:56:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.744186046511628) internal successors, (75), 67 states have internal predecessors, (75), 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:56:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-11-06 20:56:15,589 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 28 [2023-11-06 20:56:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:56:15,589 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-11-06 20:56:15,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 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-06 20:56:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-11-06 20:56:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 20:56:15,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:56:15,591 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:56:15,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 20:56:15,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:56:15,797 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-06 20:56:15,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:56:15,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1213422981, now seen corresponding path program 1 times [2023-11-06 20:56:15,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:56:15,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390403271] [2023-11-06 20:56:15,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:56:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:56:16,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:56:16,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390403271] [2023-11-06 20:56:16,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390403271] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:56:16,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926430386] [2023-11-06 20:56:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:56:16,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:56:16,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:56:16,975 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:56:16,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18472697-dfbb-48c1-bfd3-21844adc1fce/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 20:56:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:56:17,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-06 20:56:17,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:56:17,462 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 25 treesize of output 17 [2023-11-06 20:56:17,467 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 19 treesize of output 11 [2023-11-06 20:56:17,549 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-06 20:56:17,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:56:17,567 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 33 treesize of output 26 [2023-11-06 20:56:17,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:56:17,576 INFO L351 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 24 treesize of output 19 [2023-11-06 20:56:17,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:56:17,599 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 31 treesize of output 24 [2023-11-06 20:56:17,609 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 20:56:17,609 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