./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI --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 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:47:26,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:47:26,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:47:26,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:47:26,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:47:26,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:47:26,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:47:26,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:47:26,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:47:26,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:47:26,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:47:26,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:47:26,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:47:26,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:47:26,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:47:26,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:47:26,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:47:26,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:47:26,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:47:26,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:47:26,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:47:26,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:47:26,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:47:26,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:47:26,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:47:26,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:47:26,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:47:26,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:47:26,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:47:26,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:47:26,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:47:26,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:47:26,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:47:26,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:47:26,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:47:26,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:47:26,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:47:26,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:47:26,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:47:26,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:47:26,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:47:26,689 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 01:47:26,712 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:47:26,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:47:26,713 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:47:26,714 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:47:26,714 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:47:26,714 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:47:26,715 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:47:26,715 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:47:26,715 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:47:26,716 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:47:26,716 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:47:26,716 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:47:26,716 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:47:26,717 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:47:26,717 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:47:26,717 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:47:26,717 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:47:26,718 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:47:26,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:47:26,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:47:26,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:47:26,719 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:47:26,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:47:26,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:47:26,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:47:26,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:47:26,721 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:47:26,721 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:47:26,721 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:47:26,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:47:26,722 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:47:26,722 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:47:26,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:47:26,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:47:26,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:47:26,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:47:26,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:47:26,724 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:47:26,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:47:26,724 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:47:26,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:47:26,725 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:47:26,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/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_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI 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 -> 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 [2022-11-03 01:47:27,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:47:27,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:47:27,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:47:27,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:47:27,071 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:47:27,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2022-11-03 01:47:27,159 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/data/873b1d99f/3b72a4aadeec468f89b122c6ac196b2c/FLAGe11bdc9f0 [2022-11-03 01:47:27,701 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:47:27,701 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2022-11-03 01:47:27,713 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/data/873b1d99f/3b72a4aadeec468f89b122c6ac196b2c/FLAGe11bdc9f0 [2022-11-03 01:47:28,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/data/873b1d99f/3b72a4aadeec468f89b122c6ac196b2c [2022-11-03 01:47:28,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:47:28,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:47:28,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:47:28,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:47:28,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:47:28,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2842228d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28, skipping insertion in model container [2022-11-03 01:47:28,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:47:28,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:47:28,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2022-11-03 01:47:28,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:47:28,528 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:47:28,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2022-11-03 01:47:28,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:47:28,620 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:47:28,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28 WrapperNode [2022-11-03 01:47:28,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:47:28,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:47:28,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:47:28,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:47:28,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,671 INFO L138 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2022-11-03 01:47:28,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:47:28,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:47:28,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:47:28,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:47:28,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,710 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:47:28,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:47:28,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:47:28,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:47:28,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (1/1) ... [2022-11-03 01:47:28,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:47:28,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:28,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:47:28,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:47:28,806 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-03 01:47:28,807 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-03 01:47:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:47:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:47:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:47:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:47:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:47:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:47:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:47:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 01:47:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:47:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:47:28,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:47:28,948 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:47:28,951 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:47:29,018 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-03 01:47:29,266 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:47:29,296 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:47:29,297 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 01:47:29,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:47:29 BoogieIcfgContainer [2022-11-03 01:47:29,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:47:29,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:47:29,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:47:29,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:47:29,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:47:28" (1/3) ... [2022-11-03 01:47:29,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa5e919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:47:29, skipping insertion in model container [2022-11-03 01:47:29,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:47:28" (2/3) ... [2022-11-03 01:47:29,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa5e919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:47:29, skipping insertion in model container [2022-11-03 01:47:29,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:47:29" (3/3) ... [2022-11-03 01:47:29,320 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2022-11-03 01:47:29,343 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:47:29,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-03 01:47:29,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:47:29,441 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;@2f112005, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:47:29,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-11-03 01:47:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 33 states have (on average 2.272727272727273) internal successors, (75), 67 states have internal predecessors, (75), 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) [2022-11-03 01:47:29,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 01:47:29,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:29,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 01:47:29,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:47:29,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:29,471 INFO L85 PathProgramCache]: Analyzing trace with hash 5050762, now seen corresponding path program 1 times [2022-11-03 01:47:29,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:29,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16453682] [2022-11-03 01:47:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:29,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:29,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:29,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16453682] [2022-11-03 01:47:29,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16453682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:47:29,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:47:29,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:47:29,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329868496] [2022-11-03 01:47:29,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:47:29,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:47:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:29,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:47:29,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:47:29,849 INFO L87 Difference]: Start difference. First operand has 69 states, 33 states have (on average 2.272727272727273) internal successors, (75), 67 states have internal predecessors, (75), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:30,069 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-11-03 01:47:30,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:47:30,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-03 01:47:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:30,080 INFO L225 Difference]: With dead ends: 109 [2022-11-03 01:47:30,081 INFO L226 Difference]: Without dead ends: 105 [2022-11-03 01:47:30,083 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 [2022-11-03 01:47:30,086 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 56 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:30,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 102 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:47:30,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-03 01:47:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 62. [2022-11-03 01:47:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 31 states have (on average 2.129032258064516) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-11-03 01:47:30,135 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 4 [2022-11-03 01:47:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:30,136 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-11-03 01:47:30,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-11-03 01:47:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 01:47:30,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:30,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 01:47:30,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:47:30,139 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:47:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash 5050763, now seen corresponding path program 1 times [2022-11-03 01:47:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:30,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771624829] [2022-11-03 01:47:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:30,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:30,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771624829] [2022-11-03 01:47:30,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771624829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:47:30,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:47:30,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:47:30,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822777312] [2022-11-03 01:47:30,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:47:30,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:47:30,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:30,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:47:30,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:47:30,327 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:30,514 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-11-03 01:47:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:47:30,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-03 01:47:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:30,516 INFO L225 Difference]: With dead ends: 108 [2022-11-03 01:47:30,516 INFO L226 Difference]: Without dead ends: 108 [2022-11-03 01:47:30,517 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 [2022-11-03 01:47:30,518 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 60 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:30,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 110 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:47:30,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-03 01:47:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 59. [2022-11-03 01:47:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 31 states have (on average 2.032258064516129) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-11-03 01:47:30,525 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 4 [2022-11-03 01:47:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:30,526 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-11-03 01:47:30,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-11-03 01:47:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 01:47:30,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:30,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 01:47:30,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:47:30,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:47:30,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash 5174857, now seen corresponding path program 1 times [2022-11-03 01:47:30,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:30,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821384871] [2022-11-03 01:47:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:30,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:30,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:30,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821384871] [2022-11-03 01:47:30,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821384871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:47:30,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:47:30,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:47:30,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20467750] [2022-11-03 01:47:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:47:30,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:47:30,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:47:30,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:47:30,588 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:30,609 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-11-03 01:47:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:47:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-03 01:47:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:30,611 INFO L225 Difference]: With dead ends: 69 [2022-11-03 01:47:30,611 INFO L226 Difference]: Without dead ends: 69 [2022-11-03 01:47:30,612 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 [2022-11-03 01:47:30,613 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:30,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:47:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-03 01:47:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2022-11-03 01:47:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 2.0) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-11-03 01:47:30,626 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 4 [2022-11-03 01:47:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:30,626 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-11-03 01:47:30,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-11-03 01:47:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:47:30,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:30,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:30,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:47:30,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:47:30,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 150200334, now seen corresponding path program 1 times [2022-11-03 01:47:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:30,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059648055] [2022-11-03 01:47:30,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:30,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:30,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:30,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059648055] [2022-11-03 01:47:30,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059648055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:47:30,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:47:30,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:47:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720118103] [2022-11-03 01:47:30,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:47:30,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:47:30,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:30,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:47:30,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:47:30,692 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:30,730 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-11-03 01:47:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:47:30,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 01:47:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:30,731 INFO L225 Difference]: With dead ends: 66 [2022-11-03 01:47:30,731 INFO L226 Difference]: Without dead ends: 66 [2022-11-03 01:47:30,732 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 [2022-11-03 01:47:30,733 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:30,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:47:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-03 01:47:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-11-03 01:47:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-03 01:47:30,740 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2022-11-03 01:47:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:30,740 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-03 01:47:30,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-03 01:47:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:47:30,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:30,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:30,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:47:30,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:47:30,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash -732865500, now seen corresponding path program 1 times [2022-11-03 01:47:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:30,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971646009] [2022-11-03 01:47:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:30,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:30,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971646009] [2022-11-03 01:47:30,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971646009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:47:30,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901852506] [2022-11-03 01:47:30,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:30,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:30,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:30,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:30,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:47:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:30,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:47:30,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:31,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:31,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901852506] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:31,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1235290264] [2022-11-03 01:47:31,080 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-03 01:47:31,081 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:47:31,089 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:47:31,101 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:47:31,102 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:47:31,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:47:31,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:47:31,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:47:31,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 01:47:31,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:47:31,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:47:31,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:47:31,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:47:31,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:47:31,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:47:31,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:47:31,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-03 01:47:31,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-03 01:47:31,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-03 01:47:31,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:47:31,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:47:31,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:31,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:47:32,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:47:32,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,191 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 01:47:32,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-03 01:47:32,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,241 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 01:47:32,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-03 01:47:32,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,284 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:47:32,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 395 treesize of output 376 [2022-11-03 01:47:32,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-03 01:47:32,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-03 01:47:32,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-03 01:47:32,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:47:32,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:47:32,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:47:32,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:47:32,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,882 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 01:47:32,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-03 01:47:32,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,934 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:47:32,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 395 treesize of output 376 [2022-11-03 01:47:32,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:32,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:32,979 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 01:47:32,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-03 01:47:33,388 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 01:47:33,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 313 treesize of output 320 [2022-11-03 01:47:33,782 INFO L356 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-03 01:47:33,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 393 treesize of output 384 [2022-11-03 01:47:33,830 INFO L356 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-03 01:47:33,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 393 treesize of output 384 [2022-11-03 01:47:33,883 INFO L356 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-03 01:47:33,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 386 [2022-11-03 01:47:33,977 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:47:37,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1235290264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:47:37,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:47:37,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2022-11-03 01:47:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904449442] [2022-11-03 01:47:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:47:37,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:47:37,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:37,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:47:37,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:47:37,487 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:38,478 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-03 01:47:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:47:38,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 01:47:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:38,479 INFO L225 Difference]: With dead ends: 76 [2022-11-03 01:47:38,480 INFO L226 Difference]: Without dead ends: 76 [2022-11-03 01:47:38,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:47:38,481 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:38,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:47:38,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-03 01:47:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2022-11-03 01:47:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.75) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-03 01:47:38,486 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 11 [2022-11-03 01:47:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:38,486 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-03 01:47:38,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-03 01:47:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:47:38,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:38,487 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-03 01:47:38,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:38,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:38,688 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:47:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1488330647, now seen corresponding path program 1 times [2022-11-03 01:47:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:38,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837196576] [2022-11-03 01:47:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:38,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:38,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:38,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837196576] [2022-11-03 01:47:38,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837196576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:47:38,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062861962] [2022-11-03 01:47:38,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:38,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:38,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:38,977 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:38,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:47:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:39,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:47:39,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:39,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 01:47:39,159 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:47:39,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 01:47:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:39,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:39,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062861962] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:39,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1173807917] [2022-11-03 01:47:39,318 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 01:47:39,318 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:47:39,319 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:47:39,319 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:47:39,319 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:47:39,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:47:39,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:47:39,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 01:47:39,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:47:39,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:47:39,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:47:39,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:47:39,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:47:39,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:47:39,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:47:39,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:47:39,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 01:47:39,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:47:39,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:47:39,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:47:39,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:47:39,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:47:39,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:47:39,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:39,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:39,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:39,995 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:47:39,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:47:40,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:40,031 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:47:40,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-03 01:47:40,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:40,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:40,066 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:47:40,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:47:40,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 01:47:40,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:47:40,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:47:40,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:47:40,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:47:40,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:47:40,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:47:40,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:40,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:40,536 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:47:40,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:47:40,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:40,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:40,579 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:47:40,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:47:40,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:40,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:40,617 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:47:40,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-03 01:47:40,966 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 01:47:40,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 310 treesize of output 317 [2022-11-03 01:47:41,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:47:41,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 387 [2022-11-03 01:47:41,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:47:41,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 387 [2022-11-03 01:47:41,328 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:47:41,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 392 treesize of output 389 [2022-11-03 01:47:41,404 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:47:45,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1173807917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:47:45,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:47:45,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 3, 4] total 13 [2022-11-03 01:47:45,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212518349] [2022-11-03 01:47:45,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:47:45,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:47:45,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:45,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:47:45,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:47:45,105 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:46,146 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-11-03 01:47:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:47:46,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:47:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:46,148 INFO L225 Difference]: With dead ends: 74 [2022-11-03 01:47:46,148 INFO L226 Difference]: Without dead ends: 74 [2022-11-03 01:47:46,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:47:46,152 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:46,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 116 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:47:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-03 01:47:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-11-03 01:47:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-03 01:47:46,162 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 15 [2022-11-03 01:47:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:46,162 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-03 01:47:46,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-03 01:47:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:47:46,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:46,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:46,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:46,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:46,375 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:47:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash 891856784, now seen corresponding path program 1 times [2022-11-03 01:47:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:46,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513037938] [2022-11-03 01:47:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:47:46,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:46,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513037938] [2022-11-03 01:47:46,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513037938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:47:46,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156402103] [2022-11-03 01:47:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:46,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:46,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:46,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:46,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:47:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:46,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:47:46,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:46,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 01:47:46,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:46,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2022-11-03 01:47:46,784 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:47:46,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 01:47:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:47:46,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:47:46,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156402103] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:46,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1057353889] [2022-11-03 01:47:46,876 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-03 01:47:46,876 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:47:46,876 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:47:46,877 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:47:46,877 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:47:46,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:46,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:46,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:47:46,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:46,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:46,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:46,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:46,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:46,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:47:46,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:47:46,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:46,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 01:47:47,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:47:47,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:47:47,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:47:47,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:47:47,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:47:47,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:47:47,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:47:47,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 01:47:47,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:47:47,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:47:47,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:47:47,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:47:47,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:47:47,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:47:47,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,507 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:47:47,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:47:47,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,546 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:47:47,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:47:47,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,578 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:47:47,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-03 01:47:47,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:47,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,762 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:47:47,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-03 01:47:47,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,807 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:47:47,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 385 [2022-11-03 01:47:47,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:47,850 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:47:47,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 386 treesize of output 381 [2022-11-03 01:47:48,325 INFO L356 Elim1Store]: treesize reduction 184, result has 14.8 percent of original size [2022-11-03 01:47:48,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 596 treesize of output 590 [2022-11-03 01:47:48,585 INFO L356 Elim1Store]: treesize reduction 200, result has 14.5 percent of original size [2022-11-03 01:47:48,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 647 treesize of output 539 [2022-11-03 01:47:48,652 INFO L356 Elim1Store]: treesize reduction 130, result has 17.7 percent of original size [2022-11-03 01:47:48,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 643 treesize of output 639 [2022-11-03 01:47:48,723 INFO L356 Elim1Store]: treesize reduction 200, result has 13.8 percent of original size [2022-11-03 01:47:48,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 647 treesize of output 617 [2022-11-03 01:47:48,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:48,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:48,912 INFO L356 Elim1Store]: treesize reduction 125, result has 5.3 percent of original size [2022-11-03 01:47:48,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 658 treesize of output 642 [2022-11-03 01:47:48,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,006 INFO L356 Elim1Store]: treesize reduction 200, result has 17.0 percent of original size [2022-11-03 01:47:49,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 548 [2022-11-03 01:47:49,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,100 INFO L356 Elim1Store]: treesize reduction 222, result has 16.9 percent of original size [2022-11-03 01:47:49,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 626 [2022-11-03 01:47:49,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:49,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:49,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,245 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:47:49,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-03 01:47:49,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:49,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,286 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:47:49,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:47:49,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:49,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,328 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:47:49,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:47:49,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,504 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:47:49,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 385 [2022-11-03 01:47:49,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,552 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:47:49,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 386 treesize of output 381 [2022-11-03 01:47:49,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:49,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:49,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:49,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:49,586 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-03 01:47:49,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 379 treesize of output 360 [2022-11-03 01:47:49,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 9 [2022-11-03 01:47:49,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:47:49,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:47:50,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:47:50,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:47:50,029 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:47:53,921 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1266#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_dll_remove_last_#in~head#1.offset|) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_dll_remove_last_#in~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)) (= |ULTIMATE.start_dll_remove_last_#in~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (= |ULTIMATE.start_dll_remove_last_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:47:53,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:47:53,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:47:53,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-11-03 01:47:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129018432] [2022-11-03 01:47:53,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:47:53,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:47:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:47:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:47:53,924 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:54,057 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-11-03 01:47:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:47:54,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 01:47:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:54,059 INFO L225 Difference]: With dead ends: 115 [2022-11-03 01:47:54,059 INFO L226 Difference]: Without dead ends: 115 [2022-11-03 01:47:54,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:47:54,060 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 124 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:54,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 88 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-11-03 01:47:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-03 01:47:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2022-11-03 01:47:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.702127659574468) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-11-03 01:47:54,070 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 19 [2022-11-03 01:47:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:54,070 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-11-03 01:47:54,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-11-03 01:47:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:47:54,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:54,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:54,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:54,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:54,279 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:47:54,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:54,280 INFO L85 PathProgramCache]: Analyzing trace with hash 891856785, now seen corresponding path program 1 times [2022-11-03 01:47:54,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:47:54,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335631785] [2022-11-03 01:47:54,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:47:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:54,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:47:54,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335631785] [2022-11-03 01:47:54,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335631785] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:47:54,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117575002] [2022-11-03 01:47:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:54,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:54,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:54,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:54,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:47:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:54,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 01:47:54,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:54,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 01:47:54,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:54,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2022-11-03 01:47:54,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:54,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2022-11-03 01:47:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:47:54,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:59,202 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| Int) (v_ArrVal_359 Int)) (or (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_360 Int)) (<= (+ |c_ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| v_ArrVal_359) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| v_ArrVal_360) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2022-11-03 01:47:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:47:59,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117575002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:59,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [738803223] [2022-11-03 01:47:59,206 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-03 01:47:59,206 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:47:59,206 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:47:59,207 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:47:59,207 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:47:59,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:47:59,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:47:59,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:47:59,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:47:59,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 01:47:59,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:47:59,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:47:59,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:47:59,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:47:59,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:47:59,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:47:59,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 01:47:59,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:47:59,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:47:59,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:47:59,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:47:59,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:47:59,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:47:59,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:59,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:59,805 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:47:59,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-03 01:47:59,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:59,837 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:47:59,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 371 [2022-11-03 01:47:59,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:59,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:47:59,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:47:59,872 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:47:59,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-03 01:48:00,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:00,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:00,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:00,055 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:48:00,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 393 treesize of output 388 [2022-11-03 01:48:00,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:00,092 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-03 01:48:00,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 386 treesize of output 367 [2022-11-03 01:48:00,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:00,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 384 [2022-11-03 01:48:00,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,515 INFO L356 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-03 01:48:00,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2022-11-03 01:48:00,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-03 01:48:00,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:48:00,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-03 01:48:00,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:48:00,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:48:00,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:48:00,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:00,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:00,813 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:48:00,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-03 01:48:00,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:00,847 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:48:00,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 371 [2022-11-03 01:48:00,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:00,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:00,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:00,886 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:48:00,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-03 01:48:01,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:01,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:01,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:01,088 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:48:01,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 393 treesize of output 388 [2022-11-03 01:48:01,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:01,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:01,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:01,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:01,124 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:48:01,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 386 treesize of output 367 [2022-11-03 01:48:01,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:01,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:01,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:01,160 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:48:01,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 389 treesize of output 384 [2022-11-03 01:48:01,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 9 [2022-11-03 01:48:01,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:48:01,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:48:01,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:48:01,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:48:01,625 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:48:05,542 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1586#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (not (<= (+ |ULTIMATE.start_dll_remove_last_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_remove_last_~head#1.base|))) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_dll_remove_last_#in~head#1.offset|) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_dll_remove_last_#in~head#1.base|) (= |ULTIMATE.start_dll_remove_last_#in~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (= |ULTIMATE.start_dll_remove_last_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:48:05,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:48:05,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:48:05,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 10 [2022-11-03 01:48:05,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538377008] [2022-11-03 01:48:05,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:48:05,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:48:05,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:05,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:48:05,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=313, Unknown=1, NotChecked=38, Total=462 [2022-11-03 01:48:05,544 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:05,774 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-11-03 01:48:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:48:05,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 01:48:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:05,776 INFO L225 Difference]: With dead ends: 102 [2022-11-03 01:48:05,776 INFO L226 Difference]: Without dead ends: 102 [2022-11-03 01:48:05,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=146, Invalid=409, Unknown=1, NotChecked=44, Total=600 [2022-11-03 01:48:05,777 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 382 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:05,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 39 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 113 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2022-11-03 01:48:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-03 01:48:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 69. [2022-11-03 01:48:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5625) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-03 01:48:05,781 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 19 [2022-11-03 01:48:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:05,782 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-03 01:48:05,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-03 01:48:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:48:05,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:05,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:05,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:48:05,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:48:05,999 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:06,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:06,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1877756558, now seen corresponding path program 1 times [2022-11-03 01:48:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:06,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044904450] [2022-11-03 01:48:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:48:06,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:06,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044904450] [2022-11-03 01:48:06,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044904450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:06,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:48:06,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:48:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520286495] [2022-11-03 01:48:06,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:06,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:48:06,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:06,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:48:06,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:48:06,150 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:06,351 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-11-03 01:48:06,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:48:06,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 01:48:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:06,353 INFO L225 Difference]: With dead ends: 99 [2022-11-03 01:48:06,353 INFO L226 Difference]: Without dead ends: 99 [2022-11-03 01:48:06,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:48:06,355 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 129 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:06,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 117 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:48:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-03 01:48:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2022-11-03 01:48:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-11-03 01:48:06,359 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 20 [2022-11-03 01:48:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:06,359 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-11-03 01:48:06,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-11-03 01:48:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:48:06,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:06,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:06,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:48:06,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1877756559, now seen corresponding path program 1 times [2022-11-03 01:48:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:06,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682743862] [2022-11-03 01:48:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:48:06,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:06,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682743862] [2022-11-03 01:48:06,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682743862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:06,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:48:06,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:48:06,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516723159] [2022-11-03 01:48:06,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:06,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:48:06,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:06,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:48:06,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:48:06,697 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:06,918 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-11-03 01:48:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:48:06,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 01:48:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:06,920 INFO L225 Difference]: With dead ends: 93 [2022-11-03 01:48:06,920 INFO L226 Difference]: Without dead ends: 93 [2022-11-03 01:48:06,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:48:06,921 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 205 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:06,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 101 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:48:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-03 01:48:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 67. [2022-11-03 01:48:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-11-03 01:48:06,925 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 20 [2022-11-03 01:48:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:06,925 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-11-03 01:48:06,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-11-03 01:48:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 01:48:06,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:06,926 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:06,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 01:48:06,926 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:06,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:06,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1916465157, now seen corresponding path program 1 times [2022-11-03 01:48:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:06,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165512941] [2022-11-03 01:48:06,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:06,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:48:07,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:07,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165512941] [2022-11-03 01:48:07,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165512941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:07,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:48:07,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:48:07,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028394242] [2022-11-03 01:48:07,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:07,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:48:07,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:07,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:48:07,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:48:07,014 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:07,034 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-11-03 01:48:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:48:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 01:48:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:07,037 INFO L225 Difference]: With dead ends: 94 [2022-11-03 01:48:07,037 INFO L226 Difference]: Without dead ends: 94 [2022-11-03 01:48:07,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:48:07,038 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 108 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:07,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 94 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:48:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-03 01:48:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2022-11-03 01:48:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2022-11-03 01:48:07,042 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 21 [2022-11-03 01:48:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:07,043 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2022-11-03 01:48:07,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-11-03 01:48:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:48:07,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:07,045 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:07,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 01:48:07,045 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1703376233, now seen corresponding path program 1 times [2022-11-03 01:48:07,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:07,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531304922] [2022-11-03 01:48:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:48:07,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:07,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531304922] [2022-11-03 01:48:07,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531304922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:07,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:48:07,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:48:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801880916] [2022-11-03 01:48:07,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:07,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:48:07,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:07,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:48:07,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:48:07,199 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:07,314 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-03 01:48:07,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:48:07,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 01:48:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:07,315 INFO L225 Difference]: With dead ends: 65 [2022-11-03 01:48:07,315 INFO L226 Difference]: Without dead ends: 65 [2022-11-03 01:48:07,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:48:07,316 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 166 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:07,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 55 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:48:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-03 01:48:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-03 01:48:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-03 01:48:07,318 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 23 [2022-11-03 01:48:07,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:07,318 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-03 01:48:07,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-03 01:48:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:48:07,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:07,319 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:07,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 01:48:07,320 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1703360589, now seen corresponding path program 1 times [2022-11-03 01:48:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:07,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040091412] [2022-11-03 01:48:07,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:07,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:48:07,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:07,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040091412] [2022-11-03 01:48:07,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040091412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:07,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:48:07,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:48:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695560408] [2022-11-03 01:48:07,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:07,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:48:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:48:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:48:07,399 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:07,501 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-03 01:48:07,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:48:07,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 01:48:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:07,503 INFO L225 Difference]: With dead ends: 65 [2022-11-03 01:48:07,503 INFO L226 Difference]: Without dead ends: 65 [2022-11-03 01:48:07,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:48:07,505 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 31 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:07,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 65 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:48:07,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-03 01:48:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-11-03 01:48:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-03 01:48:07,508 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 23 [2022-11-03 01:48:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:07,508 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-03 01:48:07,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-03 01:48:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:48:07,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:07,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:07,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 01:48:07,513 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:07,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1703360588, now seen corresponding path program 1 times [2022-11-03 01:48:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:07,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755054554] [2022-11-03 01:48:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:48:07,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:07,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755054554] [2022-11-03 01:48:07,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755054554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:07,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:48:07,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:48:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917205598] [2022-11-03 01:48:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:07,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:48:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:07,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:48:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:48:07,822 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:08,146 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-11-03 01:48:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:48:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 01:48:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:08,148 INFO L225 Difference]: With dead ends: 103 [2022-11-03 01:48:08,148 INFO L226 Difference]: Without dead ends: 103 [2022-11-03 01:48:08,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:48:08,149 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 222 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:08,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 110 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:48:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-03 01:48:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-11-03 01:48:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-11-03 01:48:08,151 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2022-11-03 01:48:08,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:08,152 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-11-03 01:48:08,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-11-03 01:48:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:48:08,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:08,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:08,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 01:48:08,153 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1265055569, now seen corresponding path program 1 times [2022-11-03 01:48:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:08,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984832091] [2022-11-03 01:48:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:48:08,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:08,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984832091] [2022-11-03 01:48:08,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984832091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:08,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:48:08,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:48:08,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260102004] [2022-11-03 01:48:08,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:08,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:48:08,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:08,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:48:08,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:48:08,321 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:08,490 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-11-03 01:48:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:48:08,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:48:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:08,491 INFO L225 Difference]: With dead ends: 87 [2022-11-03 01:48:08,491 INFO L226 Difference]: Without dead ends: 87 [2022-11-03 01:48:08,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:48:08,492 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 168 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:08,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 84 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:48:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-03 01:48:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2022-11-03 01:48:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-11-03 01:48:08,494 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 24 [2022-11-03 01:48:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:08,494 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-11-03 01:48:08,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-11-03 01:48:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:48:08,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:08,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:08,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 01:48:08,496 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:08,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash -562016871, now seen corresponding path program 1 times [2022-11-03 01:48:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:08,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936122446] [2022-11-03 01:48:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:08,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:48:08,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:08,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936122446] [2022-11-03 01:48:08,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936122446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:08,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:48:08,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:48:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356093212] [2022-11-03 01:48:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:08,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:48:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:08,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:48:08,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:48:08,588 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:08,679 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-11-03 01:48:08,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:48:08,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:48:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:08,680 INFO L225 Difference]: With dead ends: 73 [2022-11-03 01:48:08,680 INFO L226 Difference]: Without dead ends: 73 [2022-11-03 01:48:08,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:48:08,681 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:08,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 81 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:48:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-03 01:48:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-03 01:48:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-11-03 01:48:08,684 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 25 [2022-11-03 01:48:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:08,685 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-11-03 01:48:08,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-11-03 01:48:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:48:08,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:08,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:08,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 01:48:08,686 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:08,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash -546984227, now seen corresponding path program 1 times [2022-11-03 01:48:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:08,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707005822] [2022-11-03 01:48:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:48:09,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:09,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707005822] [2022-11-03 01:48:09,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707005822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:09,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:48:09,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 01:48:09,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037020600] [2022-11-03 01:48:09,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:09,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:48:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:48:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:48:09,019 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:09,371 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-11-03 01:48:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:48:09,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:48:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:09,372 INFO L225 Difference]: With dead ends: 75 [2022-11-03 01:48:09,372 INFO L226 Difference]: Without dead ends: 75 [2022-11-03 01:48:09,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-11-03 01:48:09,373 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 152 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:09,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 110 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:48:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-03 01:48:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-11-03 01:48:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-11-03 01:48:09,376 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 25 [2022-11-03 01:48:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:09,376 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-11-03 01:48:09,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-11-03 01:48:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 01:48:09,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:09,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:09,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 01:48:09,377 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash -242653710, now seen corresponding path program 1 times [2022-11-03 01:48:09,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:09,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908033918] [2022-11-03 01:48:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:09,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:48:09,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:09,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908033918] [2022-11-03 01:48:09,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908033918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:48:09,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247753640] [2022-11-03 01:48:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:09,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:48:09,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:48:09,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:48:09,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:48:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:09,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:48:09,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:48:09,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:09,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2022-11-03 01:48:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:48:09,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:48:09,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247753640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:48:09,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:48:09,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-03 01:48:09,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586257970] [2022-11-03 01:48:09,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:48:09,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:48:09,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:09,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:48:09,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:48:09,873 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:09,986 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-11-03 01:48:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:48:09,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 01:48:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:09,988 INFO L225 Difference]: With dead ends: 78 [2022-11-03 01:48:09,988 INFO L226 Difference]: Without dead ends: 78 [2022-11-03 01:48:09,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:48:09,989 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 138 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:09,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 54 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:48:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-03 01:48:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2022-11-03 01:48:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.368421052631579) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-03 01:48:09,991 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 26 [2022-11-03 01:48:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:09,992 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-03 01:48:09,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-03 01:48:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 01:48:09,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:09,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:10,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:48:10,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:48:10,207 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash 223361305, now seen corresponding path program 1 times [2022-11-03 01:48:10,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:10,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575950812] [2022-11-03 01:48:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:48:10,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:10,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575950812] [2022-11-03 01:48:10,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575950812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:48:10,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051171808] [2022-11-03 01:48:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:48:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:48:10,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:48:10,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:48:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:10,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-03 01:48:10,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:48:11,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-03 01:48:11,070 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:48:11,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 01:48:11,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:11,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:11,164 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:48:11,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-03 01:48:11,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 37 [2022-11-03 01:48:11,419 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-03 01:48:11,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2022-11-03 01:48:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:48:11,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:48:11,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 20 [2022-11-03 01:48:11,570 INFO L356 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-11-03 01:48:11,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 27 [2022-11-03 01:48:11,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_994))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-03 01:48:11,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_992 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_992)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_994))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-03 01:48:11,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:11,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2022-11-03 01:48:11,657 INFO L356 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-11-03 01:48:11,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 115 [2022-11-03 01:48:11,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:11,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 99 treesize of output 91 [2022-11-03 01:48:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:48:11,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051171808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:48:11,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1573186026] [2022-11-03 01:48:11,867 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 01:48:11,867 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:48:11,868 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:48:11,868 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:48:11,868 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:48:11,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:11,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:11,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:48:11,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:11,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:11,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:11,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:11,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:11,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:48:11,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:11,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 01:48:11,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:48:11,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:48:12,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:12,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:12,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:48:12,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:12,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:12,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:48:12,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 01:48:12,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:48:12,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:48:12,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 01:48:12,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:48:12,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:48:12,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:48:12,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:48:12,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:48:12,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:48:12,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:12,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-03 01:48:12,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:12,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-03 01:48:12,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:48:12,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,782 INFO L356 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-03 01:48:12,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2022-11-03 01:48:12,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:48:12,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-03 01:48:12,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-03 01:48:12,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:48:12,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:48:12,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:12,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:48:13,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:48:13,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:48:13,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:48:13,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:48:13,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:48:13,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:48:13,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 9 [2022-11-03 01:48:13,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:48:13,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:48:13,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:48:13,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:48:13,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:13,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:13,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 01:48:13,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 01:48:13,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:13,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:13,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 01:48:13,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:13,375 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:48:13,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-03 01:48:13,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:13,398 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:48:13,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:48:13,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 9 [2022-11-03 01:48:13,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:48:13,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:48:13,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:48:13,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:48:13,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 01:48:13,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:13,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:13,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:13,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 01:48:13,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:13,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:13,637 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:48:13,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:48:13,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:13,660 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:48:13,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-03 01:48:13,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:13,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 01:48:13,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 9 [2022-11-03 01:48:13,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:48:14,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:48:14,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:48:14,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:48:14,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:14,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:14,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:14,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:14,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:14,128 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:48:14,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-03 01:48:14,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:14,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:14,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:48:14,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:48:14,269 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:48:14,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-03 01:48:14,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:14,367 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:48:18,541 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3717#(and (<= 0 |ULTIMATE.start_dll_remove_last_~head#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= |ULTIMATE.start_dll_remove_last_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= 0 |ULTIMATE.start_dll_remove_last_#in~head#1.base|) (<= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= 0 |ULTIMATE.start_dll_remove_last_~head#1.base|) (<= 0 |ULTIMATE.start_dll_remove_last_#in~head#1.offset|) (<= 0 (+ |ULTIMATE.start_dll_create_~len#1| 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (not (= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#1.base|) 1)) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)) (= |#NULL.base| 0))' at error location [2022-11-03 01:48:18,541 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:48:18,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:48:18,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 31 [2022-11-03 01:48:18,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035101951] [2022-11-03 01:48:18,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:48:18,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:48:18,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:48:18,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:48:18,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1874, Unknown=2, NotChecked=178, Total=2256 [2022-11-03 01:48:18,544 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:18,712 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse0 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (forall ((v_ArrVal_992 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_992)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_994))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse3 .cse2) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) is different from false [2022-11-03 01:48:18,716 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_994))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-11-03 01:48:18,720 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_994))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-11-03 01:48:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:48:19,675 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2022-11-03 01:48:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:48:19,676 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 01:48:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:48:19,676 INFO L225 Difference]: With dead ends: 145 [2022-11-03 01:48:19,676 INFO L226 Difference]: Without dead ends: 145 [2022-11-03 01:48:19,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=353, Invalid=2968, Unknown=5, NotChecked=580, Total=3906 [2022-11-03 01:48:19,678 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 246 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:48:19,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 352 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 780 Invalid, 0 Unknown, 327 Unchecked, 0.5s Time] [2022-11-03 01:48:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-03 01:48:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 88. [2022-11-03 01:48:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.337837837837838) internal successors, (99), 87 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-11-03 01:48:19,682 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2022-11-03 01:48:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:48:19,682 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-11-03 01:48:19,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:48:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-11-03 01:48:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 01:48:19,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:48:19,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:48:19,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:48:19,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:48:19,895 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-03 01:48:19,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:48:19,895 INFO L85 PathProgramCache]: Analyzing trace with hash 223361306, now seen corresponding path program 1 times [2022-11-03 01:48:19,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:48:19,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313083422] [2022-11-03 01:48:19,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:48:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:48:20,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:48:20,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313083422] [2022-11-03 01:48:20,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313083422] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:48:20,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063492814] [2022-11-03 01:48:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:20,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:48:20,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:48:20,954 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:48:20,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fbf450f-8137-45d5-84f5-ccf44d2d87a0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:48:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:21,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-03 01:48:21,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:48:21,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:48:21,256 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:48:21,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 01:48:21,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:21,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:21,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:21,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:48:21,477 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:48:21,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 60 [2022-11-03 01:48:21,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-03 01:48:22,047 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-03 01:48:22,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 62 [2022-11-03 01:48:22,079 INFO L356 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-11-03 01:48:22,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 38 [2022-11-03 01:48:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:48:22,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:48:22,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:22,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 329 [2022-11-03 01:48:24,235 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))) (and (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse6 (select (select .cse3 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse2 (select (select .cse8 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ 4 .cse6))) (let ((.cse1 (select (select .cse8 .cse2) .cse4)) (.cse0 (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse7 (select (select .cse7 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse1 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (= .cse1 .cse0) (< (select (select .cse3 .cse2) .cse4) .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse6)))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse14 (select (select .cse16 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse11 (select (select .cse12 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse14 4))) (let ((.cse10 (select (select .cse16 .cse11) .cse13)) (.cse9 (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse15 (select (select .cse15 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< .cse10 .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11)) (= .cse10 0) (= .cse9 (select (select .cse12 .cse11) .cse13)) (not (= .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1100))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1101) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (select (select .cse19 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse18)) (<= 0 (+ (select (select .cse19 .cse18) (+ .cse17 4)) 4)))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse21 (select (select .cse24 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (select (select .cse24 .cse21) (+ 4 .cse23)))) (or (= .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse20 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse21)) (= .cse20 (select (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse22 (select (select .cse22 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse23))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse25 (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse32 (select (select .cse32 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse25 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse30 (select (select .cse28 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse27 (select (select .cse31 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse29 (+ .cse30 4))) (let ((.cse26 (select (select .cse31 .cse27) .cse29))) (or (= .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse27)) (= (select (select .cse28 .cse27) .cse29) 0) (= .cse25 .cse26) (not (= .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse38 (select (select .cse39 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse34 (select (select .cse36 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (+ .cse38 4))) (let ((.cse33 (select (select .cse39 .cse34) .cse37))) (or (< .cse33 .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse34)) (= .cse33 0) (= (select (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse35 (select (select .cse35 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse36 .cse34) .cse37)) (not (= .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse41 (select (select .cse43 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse40 (select (select .cse43 .cse41) (+ 4 .cse42)))) (or (= .cse40 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse40 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse41)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse42))))))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (= (select (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse44 (select (select .cse44 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse48 (select (select .cse50 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse46 (select (select .cse50 .cse48) (+ 4 .cse49)))) (or (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse45 (select (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse47 (select (select .cse47 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse45 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse46 .cse45)))) (= .cse46 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse46 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse48)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse49))))))) (or (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (= (select (let ((.cse51 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse51 (select (select .cse51 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse56 (select (select .cse55 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse53 (select (select .cse52 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse54 (+ .cse56 4))) (or (= (select (select .cse52 .cse53) .cse54) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse53)) (= (select (select .cse55 .cse53) .cse54) 0) (not (= .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse61 (select (select .cse59 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse58 (select (select .cse62 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse60 (+ 4 .cse61))) (let ((.cse57 (select (select .cse62 .cse58) .cse60))) (or (= .cse57 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse57 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse58)) (< (select (select .cse59 .cse58) .cse60) .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse61)))))))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse64 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse65 (select (select .cse66 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse63 (select (select .cse66 .cse64) (+ .cse65 4)))) (or (< .cse63 .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse64)) (= .cse63 0) (not (= .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse71 (select (select .cse72 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse68 (select (select .cse67 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (+ .cse71 4))) (let ((.cse70 (select (select .cse72 .cse68) .cse69))) (or (= (select (select .cse67 .cse68) .cse69) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< .cse70 .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse68)) (= .cse70 0) (not (= .cse71 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse76 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse77 (select (select .cse76 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse74 (select (select .cse73 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse75 (+ 4 .cse77))) (or (= (select (select .cse73 .cse74) .cse75) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse74)) (< (select (select .cse76 .cse74) .cse75) .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse77))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse83 (select (select .cse80 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse79 (select (select .cse84 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse81 (+ .cse83 4))) (let ((.cse78 (select (select .cse84 .cse79) .cse81))) (or (= .cse78 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse79)) (= (select (select .cse80 .cse79) .cse81) 0) (= (select (let ((.cse82 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse82 (select (select .cse82 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse78) (not (= .cse83 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))))) is different from false [2022-11-03 01:48:27,041 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse87 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse87 0))) (.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse87 0)))) (and (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse3 (select (select .cse4 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse1 (select (select .cse10 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse3 4))) (let ((.cse0 (select (select .cse10 .cse1) .cse5)) (.cse2 (select (let ((.cse7 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse7 (select (select .cse7 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse3)) (< (select (select .cse4 .cse1) .cse5) .cse6) (= .cse0 .cse2))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse18 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse13 (select (select .cse18 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse11 (select (select .cse15 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (+ .cse13 4))) (let ((.cse12 (select (select .cse18 .cse11) .cse16)) (.cse14 (select (let ((.cse17 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse17 (select (select .cse17 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse12 0) (< .cse12 .cse6) (not (= .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse14 (select (select .cse15 .cse11) .cse16)) (= .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse24 (select (let ((.cse26 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse26 (select (select .cse26 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse20 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse23 (select (select .cse20 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse19 (select (select .cse25 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse21 (+ .cse23 4))) (let ((.cse22 (select (select .cse25 .cse19) .cse21))) (or (not (= .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse20 .cse19) .cse21) 0) (= .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse24 .cse22))))))) (= .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (or (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse28 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse31 (select (select .cse28 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse27 (select (select .cse30 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse29 (+ .cse31 4))) (or (not (= .cse27 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse28 .cse27) .cse29) 0) (= (select (select .cse30 .cse27) .cse29) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (= (select (let ((.cse32 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse32 (select (select .cse32 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (= (select (let ((.cse33 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse33 (select (select .cse33 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse37 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse35 (select (select .cse37 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select (select .cse37 .cse35) (+ .cse36 4)))) (or (= .cse34 0) (not (= .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse36)) (= .cse34 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse42 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse41 (select (select .cse42 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse38 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse39 (select (select .cse38 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (+ .cse41 4))) (or (= (select (select .cse38 .cse39) .cse40) 0) (not (= .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse41)) (< (select (select .cse42 .cse39) .cse40) .cse6)))))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse46 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse43 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (select (select .cse46 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse44 (select (select .cse46 .cse43) (+ .cse45 4)))) (or (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse44 0) (< .cse44 .cse6) (not (= .cse45 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse53 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse49 (select (select .cse53 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse51 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse47 (select (select .cse51 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (+ .cse49 4))) (let ((.cse48 (select (select .cse53 .cse47) .cse52))) (or (not (= .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse48 0) (< .cse48 .cse6) (not (= .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse50 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse50 (select (select .cse50 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse51 .cse47) .cse52)))))))) (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse54 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1100))) (let ((.cse55 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1101) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (select (select .cse54 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse54 .cse55) (+ .cse56 4)) 4)) (not (= .cse55 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse60 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse59 (select (select .cse60 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse58 (select (select .cse62 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse61 (+ .cse59 4))) (let ((.cse57 (select (select .cse62 .cse58) .cse61))) (or (= .cse57 0) (not (= .cse58 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse59)) (< (select (select .cse60 .cse58) .cse61) .cse6) (= .cse57 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse68 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse64 (select (select .cse68 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse67 (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse63 (select (select .cse68 .cse64) (+ .cse67 4)))) (or (= .cse63 0) (not (= .cse64 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse65 (select (let ((.cse66 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse66 (select (select .cse66 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse63 .cse65)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse67)) (= .cse63 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse74 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse73 (select (select .cse74 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse71 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse69 (select (select .cse71 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse72 (+ .cse73 4))) (let ((.cse70 (select (select .cse74 .cse69) .cse72))) (or (not (= .cse69 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse70 0) (< .cse70 .cse6) (= (select (select .cse71 .cse69) .cse72) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse73 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse76 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse79 (select (select .cse76 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse81 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse75 (select (select .cse81 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse77 (+ .cse79 4))) (let ((.cse78 (select (select .cse81 .cse75) .cse77))) (or (not (= .cse75 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse76 .cse75) .cse77) 0) (= .cse78 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse79 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse80 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse80 (select (select .cse80 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse78))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse86 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse83 (select (select .cse86 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse84 (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse82 (select (select .cse86 .cse83) (+ .cse84 4)))) (or (= .cse82 0) (not (= .cse83 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse84)) (= .cse82 (select (let ((.cse85 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse85 (select (select .cse85 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= .cse82 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))) is different from false [2022-11-03 01:48:27,196 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:27,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 238 [2022-11-03 01:48:27,851 INFO L356 Elim1Store]: treesize reduction 325, result has 32.2 percent of original size [2022-11-03 01:48:27,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 1054 treesize of output 1007 [2022-11-03 01:48:27,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:27,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 787 treesize of output 409 [2022-11-03 01:48:28,241 INFO L356 Elim1Store]: treesize reduction 210, result has 39.5 percent of original size [2022-11-03 01:48:28,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 1244 treesize of output 1177 [2022-11-03 01:48:28,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 902 treesize of output 876 [2022-11-03 01:48:28,856 INFO L356 Elim1Store]: treesize reduction 134, result has 62.0 percent of original size [2022-11-03 01:48:28,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 1158 treesize of output 1192 [2022-11-03 01:48:29,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:29,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1000 treesize of output 964 [2022-11-03 01:48:29,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:29,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1497 treesize of output 1395 [2022-11-03 01:48:29,550 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:48:29,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1718 treesize of output 1620 [2022-11-03 01:49:05,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-03 01:49:05,329 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-03 01:49:05,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 1 [2022-11-03 01:49:07,024 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-03 01:49:07,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 1 [2022-11-03 01:49:07,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-03 01:49:09,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-03 01:49:11,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-03 01:49:14,748 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 01:49:15,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:15,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:15,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:15,477 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 01:49:15,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:16,431 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 01:49:17,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:17,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:18,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:19,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:19,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:19,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:19,982 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 01:49:20,015 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 01:49:20,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:20,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:20,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:37,659 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 01:49:37,737 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 01:49:37,854 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 01:49:40,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-03 01:49:42,015 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-03 01:49:45,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:45,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 177 [2022-11-03 01:51:26,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:51:26,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:26,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:51:27,612 INFO L356 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-03 01:51:27,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 172 [2022-11-03 01:51:27,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:51:27,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:27,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:51:28,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:51:28,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:28,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:51:28,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:51:28,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:28,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:51:28,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:51:28,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:28,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:51:29,662 INFO L356 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-03 01:51:29,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 309 treesize of output 281 [2022-11-03 01:51:30,098 INFO L356 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-03 01:51:30,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 231 treesize of output 215 [2022-11-03 01:51:30,478 INFO L356 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-03 01:51:30,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1768 treesize of output 1636 [2022-11-03 01:51:37,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:51:37,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:37,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:51:38,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:51:38,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:38,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:51:42,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:51:42,898 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:42,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:51:44,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:51:44,792 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:44,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:52:01,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:52:01,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:01,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:52:02,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:52:02,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:02,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:52:03,172 INFO L356 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-03 01:52:03,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 172 [2022-11-03 01:52:06,584 INFO L356 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-03 01:52:06,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 317 treesize of output 289 [2022-11-03 01:52:07,825 INFO L356 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-03 01:52:07,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 765 treesize of output 681 [2022-11-03 01:52:15,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:52:15,893 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:15,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:52:16,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:52:16,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:16,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:52:21,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:52:21,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:21,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:52:24,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:52:24,142 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:24,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:52:25,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:52:25,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:25,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-03 01:52:29,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 14 [2022-11-03 01:52:40,793 WARN L234 SmtUtils]: Spent 10.80s on a formula simplification that was a NOOP. DAG size: 1251 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-03 01:52:40,794 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:40,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 1047 treesize of output 3180