./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur --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 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- 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-38b53e6 [2022-11-26 00:07:20,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:07:20,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:07:20,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:07:20,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:07:20,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:07:20,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:07:20,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:07:20,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:07:20,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:07:20,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:07:20,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:07:20,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:07:20,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:07:20,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:07:20,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:07:20,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:07:20,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:07:20,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:07:20,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:07:20,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:07:20,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:07:20,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:07:20,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:07:20,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:07:20,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:07:20,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:07:20,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:07:20,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:07:20,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:07:20,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:07:20,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:07:20,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:07:20,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:07:20,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:07:20,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:07:20,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:07:20,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:07:20,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:07:20,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:07:20,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:07:20,618 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-26 00:07:20,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:07:20,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:07:20,665 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:07:20,666 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:07:20,667 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:07:20,667 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:07:20,668 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:07:20,668 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:07:20,668 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:07:20,668 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:07:20,669 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:07:20,670 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:07:20,670 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:07:20,670 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:07:20,670 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:07:20,670 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:07:20,671 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:07:20,671 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:07:20,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:07:20,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:07:20,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:07:20,673 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:07:20,673 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:07:20,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:07:20,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:07:20,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:07:20,674 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:07:20,674 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:07:20,675 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:07:20,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:07:20,675 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:07:20,676 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:07:20,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:07:20,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:07:20,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:07:20,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:07:20,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:07:20,677 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:07:20,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:07:20,677 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:07:20,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:07:20,678 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:07:20,678 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_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/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_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur 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 -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2022-11-26 00:07:20,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:07:20,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:07:20,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:07:20,977 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:07:20,978 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:07:20,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2022-11-26 00:07:23,966 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:07:24,172 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:07:24,173 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2022-11-26 00:07:24,184 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/data/54f2c96e1/50300a6160554583a1758208bc0b80cb/FLAGfc596a8aa [2022-11-26 00:07:24,207 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/data/54f2c96e1/50300a6160554583a1758208bc0b80cb [2022-11-26 00:07:24,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:07:24,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:07:24,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:07:24,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:07:24,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:07:24,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b49550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24, skipping insertion in model container [2022-11-26 00:07:24,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:07:24,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:07:24,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:07:24,480 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:07:24,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:07:24,515 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:07:24,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24 WrapperNode [2022-11-26 00:07:24,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:07:24,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:07:24,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:07:24,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:07:24,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,561 INFO L138 Inliner]: procedures = 13, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2022-11-26 00:07:24,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:07:24,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:07:24,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:07:24,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:07:24,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,586 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:07:24,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:07:24,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:07:24,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:07:24,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (1/1) ... [2022-11-26 00:07:24,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:07:24,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:24,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:07:24,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:07:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:07:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:07:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:07:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:07:24,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:07:24,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:07:24,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:07:24,796 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:07:24,798 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:07:25,042 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:07:25,255 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:07:25,256 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-26 00:07:25,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:07:25 BoogieIcfgContainer [2022-11-26 00:07:25,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:07:25,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:07:25,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:07:25,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:07:25,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:07:24" (1/3) ... [2022-11-26 00:07:25,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b639586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:07:25, skipping insertion in model container [2022-11-26 00:07:25,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:07:24" (2/3) ... [2022-11-26 00:07:25,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b639586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:07:25, skipping insertion in model container [2022-11-26 00:07:25,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:07:25" (3/3) ... [2022-11-26 00:07:25,268 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2022-11-26 00:07:25,288 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:07:25,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-11-26 00:07:25,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:07:25,337 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;@5941a287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:07:25,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-11-26 00:07:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 15 states have (on average 2.466666666666667) internal successors, (37), 32 states have internal predecessors, (37), 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-26 00:07:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:07:25,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:25,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:07:25,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash 142550, now seen corresponding path program 1 times [2022-11-26 00:07:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:25,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854127449] [2022-11-26 00:07:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:25,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:25,635 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-26 00:07:25,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:25,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854127449] [2022-11-26 00:07:25,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854127449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:25,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:25,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:07:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607843971] [2022-11-26 00:07:25,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:25,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:07:25,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:25,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:07:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:07:25,699 INFO L87 Difference]: Start difference. First operand has 33 states, 15 states have (on average 2.466666666666667) internal successors, (37), 32 states have internal predecessors, (37), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-26 00:07:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:25,787 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-11-26 00:07:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:07:25,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2022-11-26 00:07:25,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:25,798 INFO L225 Difference]: With dead ends: 32 [2022-11-26 00:07:25,799 INFO L226 Difference]: Without dead ends: 31 [2022-11-26 00:07:25,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-26 00:07:25,804 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:25,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-26 00:07:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-26 00:07:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 30 states have internal predecessors, (35), 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-26 00:07:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-11-26 00:07:25,840 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 3 [2022-11-26 00:07:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:25,840 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-11-26 00:07:25,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-26 00:07:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-11-26 00:07:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:07:25,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:25,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:07:25,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:07:25,843 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash 142551, now seen corresponding path program 1 times [2022-11-26 00:07:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:25,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917390928] [2022-11-26 00:07:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:25,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:26,009 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-26 00:07:26,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:26,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917390928] [2022-11-26 00:07:26,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917390928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:26,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:26,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:07:26,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021482333] [2022-11-26 00:07:26,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:26,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:07:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:26,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:07:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:07:26,013 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-26 00:07:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:26,088 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-11-26 00:07:26,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:07:26,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2022-11-26 00:07:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:26,090 INFO L225 Difference]: With dead ends: 33 [2022-11-26 00:07:26,090 INFO L226 Difference]: Without dead ends: 33 [2022-11-26 00:07:26,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-26 00:07:26,091 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:26,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-26 00:07:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-26 00:07:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 2.176470588235294) internal successors, (37), 32 states have internal predecessors, (37), 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-26 00:07:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-11-26 00:07:26,098 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 3 [2022-11-26 00:07:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:26,098 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-11-26 00:07:26,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-26 00:07:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-11-26 00:07:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:07:26,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:26,100 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1] [2022-11-26 00:07:26,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:07:26,100 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash 137094661, now seen corresponding path program 1 times [2022-11-26 00:07:26,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:26,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378114530] [2022-11-26 00:07:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:26,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:26,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:26,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378114530] [2022-11-26 00:07:26,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378114530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:26,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:26,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:07:26,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212452897] [2022-11-26 00:07:26,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:26,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:07:26,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:26,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:07:26,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:07:26,307 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-26 00:07:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:26,379 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-11-26 00:07:26,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:07:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-11-26 00:07:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:26,380 INFO L225 Difference]: With dead ends: 32 [2022-11-26 00:07:26,381 INFO L226 Difference]: Without dead ends: 32 [2022-11-26 00:07:26,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:07:26,383 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:26,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 24 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-26 00:07:26,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-11-26 00:07:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 16 states have (on average 2.1875) internal successors, (35), 30 states have internal predecessors, (35), 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-26 00:07:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-11-26 00:07:26,388 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 5 [2022-11-26 00:07:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:26,389 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-11-26 00:07:26,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-26 00:07:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-11-26 00:07:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:07:26,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:26,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:07:26,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:07:26,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash -44914074, now seen corresponding path program 1 times [2022-11-26 00:07:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:26,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567881963] [2022-11-26 00:07:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:26,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:26,487 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-26 00:07:26,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:26,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567881963] [2022-11-26 00:07:26,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567881963] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:26,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495448245] [2022-11-26 00:07:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:26,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:26,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:26,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:26,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:07:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:26,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:07:26,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:26,631 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-26 00:07:26,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:26,665 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-26 00:07:26,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495448245] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:26,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [378117345] [2022-11-26 00:07:26,695 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2022-11-26 00:07:26,697 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:26,702 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:26,708 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:26,709 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:26,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:07:26,856 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 30 treesize of output 31 [2022-11-26 00:07:27,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:27,113 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 204 treesize of output 199 [2022-11-26 00:07:27,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:07:27,276 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:27,479 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '275#(and (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (= |ULTIMATE.start_getNumbers_#res#1.base| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#numbers2~0.base| 2) (= 3 |~#numbers4~0.base|) (= |ULTIMATE.start_getNumbers_#res#1.offset| |~#array~0.offset|) (= |ULTIMATE.start_getNumbers_#res#1.base| |~#array~0.base|) (= |~#array~0.offset| 0) (= |~#array~0.base| 1) (= |#NULL.offset| 0) (= |~#numbers4~0.offset| 0) (not (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|))) (= |~#numbers2~0.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers_#res#1.offset| |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:27,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:27,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:27,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-11-26 00:07:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848090761] [2022-11-26 00:07:27,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:27,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:07:27,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:27,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:07:27,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:07:27,483 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-26 00:07:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:27,552 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-26 00:07:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:07:27,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 6 [2022-11-26 00:07:27,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:27,560 INFO L225 Difference]: With dead ends: 37 [2022-11-26 00:07:27,560 INFO L226 Difference]: Without dead ends: 37 [2022-11-26 00:07:27,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:07:27,564 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:27,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-26 00:07:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-26 00:07:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 36 states have internal predecessors, (41), 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-26 00:07:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-11-26 00:07:27,577 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 6 [2022-11-26 00:07:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:27,577 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-26 00:07:27,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-26 00:07:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-11-26 00:07:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:07:27,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:27,578 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2022-11-26 00:07:27,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:27,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:27,786 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:27,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:27,787 INFO L85 PathProgramCache]: Analyzing trace with hash 550651164, now seen corresponding path program 2 times [2022-11-26 00:07:27,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:27,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006803361] [2022-11-26 00:07:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 00:07:28,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:28,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006803361] [2022-11-26 00:07:28,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006803361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:28,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:28,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:07:28,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896776847] [2022-11-26 00:07:28,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:28,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:07:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:28,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:07:28,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:07:28,028 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-26 00:07:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:28,104 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-26 00:07:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:07:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 12 [2022-11-26 00:07:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:28,106 INFO L225 Difference]: With dead ends: 43 [2022-11-26 00:07:28,106 INFO L226 Difference]: Without dead ends: 43 [2022-11-26 00:07:28,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-26 00:07:28,107 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:28,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 22 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-26 00:07:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-11-26 00:07:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 38 states have internal predecessors, (44), 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-26 00:07:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-26 00:07:28,116 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2022-11-26 00:07:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:28,116 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-26 00:07:28,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-26 00:07:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-26 00:07:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:07:28,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:28,118 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2022-11-26 00:07:28,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:07:28,119 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:28,119 INFO L85 PathProgramCache]: Analyzing trace with hash 550651163, now seen corresponding path program 1 times [2022-11-26 00:07:28,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:28,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135865359] [2022-11-26 00:07:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:28,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 00:07:28,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:28,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135865359] [2022-11-26 00:07:28,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135865359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:28,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:28,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:07:28,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454024460] [2022-11-26 00:07:28,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:28,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:07:28,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:28,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:07:28,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:07:28,198 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-26 00:07:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:28,244 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-11-26 00:07:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:07:28,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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 12 [2022-11-26 00:07:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:28,245 INFO L225 Difference]: With dead ends: 38 [2022-11-26 00:07:28,246 INFO L226 Difference]: Without dead ends: 38 [2022-11-26 00:07:28,246 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-26 00:07:28,247 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:28,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-26 00:07:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-26 00:07:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.75) internal successors, (42), 37 states have internal predecessors, (42), 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-26 00:07:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-26 00:07:28,251 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 12 [2022-11-26 00:07:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:28,251 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-26 00:07:28,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-26 00:07:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-26 00:07:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:07:28,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:28,252 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2022-11-26 00:07:28,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:07:28,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash -109683128, now seen corresponding path program 1 times [2022-11-26 00:07:28,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:28,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416235320] [2022-11-26 00:07:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 00:07:28,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:28,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416235320] [2022-11-26 00:07:28,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416235320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:28,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:28,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:07:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093726057] [2022-11-26 00:07:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:28,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:07:28,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:28,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:07:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:07:28,363 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-26 00:07:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:28,410 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-26 00:07:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:07:28,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 13 [2022-11-26 00:07:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:28,414 INFO L225 Difference]: With dead ends: 37 [2022-11-26 00:07:28,415 INFO L226 Difference]: Without dead ends: 37 [2022-11-26 00:07:28,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-26 00:07:28,416 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:28,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-26 00:07:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-26 00:07:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 36 states have internal predecessors, (41), 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-26 00:07:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-11-26 00:07:28,429 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 13 [2022-11-26 00:07:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:28,430 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-26 00:07:28,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-26 00:07:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-11-26 00:07:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:07:28,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:28,432 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2022-11-26 00:07:28,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:07:28,432 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:28,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash -109683127, now seen corresponding path program 1 times [2022-11-26 00:07:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:28,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958710247] [2022-11-26 00:07:28,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:28,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:28,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958710247] [2022-11-26 00:07:28,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958710247] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:28,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531850827] [2022-11-26 00:07:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:28,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:28,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:28,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:28,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:07:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:28,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:07:28,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:28,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:28,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531850827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:28,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1366724065] [2022-11-26 00:07:28,729 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 00:07:28,729 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:28,730 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:28,730 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:28,730 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:28,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:07:28,769 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 30 treesize of output 31 [2022-11-26 00:07:28,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:28,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:28,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:28,861 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 204 treesize of output 199 [2022-11-26 00:07:28,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:07:28,950 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:29,294 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '684#(and (= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1) (= |ULTIMATE.start_getNumbers2_~i~1#1| 0) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (= |ULTIMATE.start_getNumbers_#res#1.base| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#numbers2~0.base| 2) (= 3 |~#numbers4~0.base|) (= |ULTIMATE.start_getNumbers_#res#1.offset| |~#array~0.offset|) (= |ULTIMATE.start_getNumbers_#res#1.base| |~#array~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) |ULTIMATE.start_getNumbers2_#t~mem3#1|) (= |~#array~0.offset| 0) (not (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|))) (= |~#array~0.base| 1) (= |#NULL.offset| 0) (= |~#numbers4~0.offset| 0) (= |~#numbers2~0.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers_#res#1.offset| |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:29,294 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:29,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:29,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-26 00:07:29,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881205127] [2022-11-26 00:07:29,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:29,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:07:29,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:29,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:07:29,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:07:29,296 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-26 00:07:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:29,368 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-11-26 00:07:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:07:29,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 13 [2022-11-26 00:07:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:29,369 INFO L225 Difference]: With dead ends: 49 [2022-11-26 00:07:29,369 INFO L226 Difference]: Without dead ends: 49 [2022-11-26 00:07:29,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:07:29,370 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:29,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-26 00:07:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-26 00:07:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 48 states have internal predecessors, (53), 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-26 00:07:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-11-26 00:07:29,373 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 13 [2022-11-26 00:07:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:29,373 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-11-26 00:07:29,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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-26 00:07:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-11-26 00:07:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:07:29,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:29,374 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2022-11-26 00:07:29,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-26 00:07:29,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:29,576 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:29,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash -905746467, now seen corresponding path program 2 times [2022-11-26 00:07:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:29,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514942124] [2022-11-26 00:07:29,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:07:29,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:29,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514942124] [2022-11-26 00:07:29,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514942124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:29,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:29,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:07:29,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497095404] [2022-11-26 00:07:29,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:29,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:07:29,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:29,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:07:29,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:07:29,715 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-26 00:07:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:29,761 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-11-26 00:07:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:07:29,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-26 00:07:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:29,762 INFO L225 Difference]: With dead ends: 50 [2022-11-26 00:07:29,762 INFO L226 Difference]: Without dead ends: 50 [2022-11-26 00:07:29,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:07:29,763 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:29,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 20 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-26 00:07:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-26 00:07:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 49 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-26 00:07:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-11-26 00:07:29,766 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2022-11-26 00:07:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:29,767 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-11-26 00:07:29,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-26 00:07:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-11-26 00:07:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:07:29,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:29,768 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1] [2022-11-26 00:07:29,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:07:29,768 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1456089878, now seen corresponding path program 1 times [2022-11-26 00:07:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:29,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153834526] [2022-11-26 00:07:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:29,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 72 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:30,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:30,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153834526] [2022-11-26 00:07:30,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153834526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:30,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873204571] [2022-11-26 00:07:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:30,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:30,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:30,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:07:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:30,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-26 00:07:30,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:07:30,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:07:30,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873204571] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:30,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2146517629] [2022-11-26 00:07:30,825 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 00:07:30,825 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:30,826 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:30,826 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:30,826 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:30,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:07:30,867 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 30 treesize of output 31 [2022-11-26 00:07:30,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:30,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:30,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:30,974 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 204 treesize of output 199 [2022-11-26 00:07:31,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:07:31,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:31,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-11-26 00:07:31,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:31,177 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-26 00:07:31,177 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 132 treesize of output 143 [2022-11-26 00:07:31,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:31,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:31,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:31,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:31,415 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:32,275 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1068#(and (<= 0 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#numbers2~0.base| 2) (= 3 |~#numbers4~0.base|) (<= 1 |ULTIMATE.start_getNumbers_#res#1.base|) (<= 1 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 0 |ULTIMATE.start_getNumbers_#res#1.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= |~#array~0.offset| 0) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |~#array~0.base| 1) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (= |#NULL.offset| 0) (= |~#numbers4~0.offset| 0) (not (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|))) (= |~#numbers2~0.offset| 0) (<= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:32,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:32,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:32,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 3, 3] total 19 [2022-11-26 00:07:32,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875136798] [2022-11-26 00:07:32,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:32,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:07:32,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:07:32,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:07:32,278 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 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-26 00:07:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:32,821 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-11-26 00:07:32,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 00:07:32,822 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 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 27 [2022-11-26 00:07:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:32,823 INFO L225 Difference]: With dead ends: 60 [2022-11-26 00:07:32,824 INFO L226 Difference]: Without dead ends: 60 [2022-11-26 00:07:32,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=385, Invalid=1255, Unknown=0, NotChecked=0, Total=1640 [2022-11-26 00:07:32,825 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 136 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:32,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 63 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:07:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-26 00:07:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-11-26 00:07:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 57 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-26 00:07:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-11-26 00:07:32,829 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 27 [2022-11-26 00:07:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:32,829 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-11-26 00:07:32,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 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-26 00:07:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-11-26 00:07:32,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-26 00:07:32,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:32,830 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1] [2022-11-26 00:07:32,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:33,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 00:07:33,039 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2105854065, now seen corresponding path program 1 times [2022-11-26 00:07:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:33,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725968714] [2022-11-26 00:07:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:07:33,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:33,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725968714] [2022-11-26 00:07:33,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725968714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:33,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830777790] [2022-11-26 00:07:33,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:33,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:33,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:33,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:33,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:07:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:33,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:07:33,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:07:33,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:07:33,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830777790] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:33,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1167161895] [2022-11-26 00:07:33,788 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 00:07:33,788 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:33,789 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:33,789 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:33,789 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:33,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:07:33,829 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 30 treesize of output 31 [2022-11-26 00:07:33,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:33,903 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 204 treesize of output 199 [2022-11-26 00:07:33,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:07:34,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:34,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,076 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 142 treesize of output 147 [2022-11-26 00:07:34,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:34,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:34,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:34,204 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:34,963 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1393#(and (= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 0 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (= |~#numbers2~0.base| 2) (= 3 |~#numbers4~0.base|) (<= 1 |ULTIMATE.start_getNumbers_#res#1.base|) (<= 1 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 0 |ULTIMATE.start_getNumbers_#res#1.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) |ULTIMATE.start_getNumbers2_#t~mem3#1|) (= |~#array~0.offset| 0) (not (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|))) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |~#array~0.base| 1) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (= |#NULL.offset| 0) (= |~#numbers4~0.offset| 0) (= |~#numbers2~0.offset| 0) (<= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:34,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:34,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:34,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-26 00:07:34,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552144120] [2022-11-26 00:07:34,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:34,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:07:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:07:34,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:07:34,966 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-26 00:07:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:35,208 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-11-26 00:07:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:07:35,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 28 [2022-11-26 00:07:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:35,209 INFO L225 Difference]: With dead ends: 59 [2022-11-26 00:07:35,209 INFO L226 Difference]: Without dead ends: 59 [2022-11-26 00:07:35,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:07:35,210 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:35,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 60 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-26 00:07:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-26 00:07:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.3695652173913044) 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-26 00:07:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-11-26 00:07:35,213 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 28 [2022-11-26 00:07:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:35,213 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-11-26 00:07:35,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-26 00:07:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-11-26 00:07:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 00:07:35,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:35,214 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 5, 4, 4, 1, 1, 1] [2022-11-26 00:07:35,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:35,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-26 00:07:35,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash -198507640, now seen corresponding path program 2 times [2022-11-26 00:07:35,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:35,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781593388] [2022-11-26 00:07:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:07:35,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:35,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781593388] [2022-11-26 00:07:35,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781593388] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:35,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526325893] [2022-11-26 00:07:35,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:07:35,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:35,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:35,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:36,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:07:36,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:07:36,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:07:36,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-26 00:07:36,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-26 00:07:36,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:07:36,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526325893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:36,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:07:36,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 21 [2022-11-26 00:07:36,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997473605] [2022-11-26 00:07:36,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:36,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:07:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:36,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:07:36,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-11-26 00:07:36,483 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-26 00:07:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:36,619 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-26 00:07:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:07:36,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 36 [2022-11-26 00:07:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:36,620 INFO L225 Difference]: With dead ends: 58 [2022-11-26 00:07:36,620 INFO L226 Difference]: Without dead ends: 58 [2022-11-26 00:07:36,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:07:36,621 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 99 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:36,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 21 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-26 00:07:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-26 00:07:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 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-26 00:07:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-11-26 00:07:36,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 36 [2022-11-26 00:07:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:36,625 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-26 00:07:36,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-26 00:07:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-11-26 00:07:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-26 00:07:36,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:36,626 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 1, 1, 1, 1, 1] [2022-11-26 00:07:36,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-26 00:07:36,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:36,839 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:36,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:36,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1858670848, now seen corresponding path program 1 times [2022-11-26 00:07:36,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:36,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248228778] [2022-11-26 00:07:36,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:36,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:07:36,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:36,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248228778] [2022-11-26 00:07:36,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248228778] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:36,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600697320] [2022-11-26 00:07:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:36,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:36,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:36,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:36,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:07:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:37,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:07:37,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:07:37,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:07:37,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600697320] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:37,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [538510513] [2022-11-26 00:07:37,156 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-26 00:07:37,156 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:37,156 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:37,156 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:37,157 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:37,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:07:37,191 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 37 treesize of output 38 [2022-11-26 00:07:37,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:37,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:37,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:37,261 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 211 treesize of output 206 [2022-11-26 00:07:37,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:07:37,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:37,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-11-26 00:07:37,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:37,473 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-26 00:07:37,473 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 132 treesize of output 143 [2022-11-26 00:07:37,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:37,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:37,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:37,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:37,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:37,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:37,704 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:38,538 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2008#(and (= (select |#valid| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) 1) (= 40 (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|)) (= |ULTIMATE.start_getNumbers3_~i~2#1| 0) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| |ULTIMATE.start_getNumbers2_#res#1.offset|) (= |~#numbers2~0.base| 2) (= 3 |~#numbers4~0.base|) (= |ULTIMATE.start_getNumbers2_#res#1.base| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (<= 1 |ULTIMATE.start_getNumbers_#res#1.base|) (<= 1 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 0 |ULTIMATE.start_getNumbers_#res#1.offset|) (= |ULTIMATE.start_getNumbers2_#res#1.base| |~#numbers2~0.base|) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= |~#array~0.offset| 0) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |~#array~0.base| 1) (= |ULTIMATE.start_getNumbers2_#res#1.offset| |~#numbers2~0.offset|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) (= |#NULL.offset| 0) (= |~#numbers4~0.offset| 0) (<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|) (= |~#numbers2~0.offset| 0) (not (= (select |#valid| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) 1)) (<= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:38,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:38,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:38,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-26 00:07:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170305465] [2022-11-26 00:07:38,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:38,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:07:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:07:38,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:07:38,540 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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-26 00:07:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:38,631 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-11-26 00:07:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:07:38,631 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 37 [2022-11-26 00:07:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:38,632 INFO L225 Difference]: With dead ends: 79 [2022-11-26 00:07:38,632 INFO L226 Difference]: Without dead ends: 79 [2022-11-26 00:07:38,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:07:38,633 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 34 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.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:38,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 34 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-26 00:07:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-11-26 00:07:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 73 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-26 00:07:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-11-26 00:07:38,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 37 [2022-11-26 00:07:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:38,637 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-11-26 00:07:38,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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-26 00:07:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-11-26 00:07:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-26 00:07:38,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:38,639 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 5, 5, 4, 1, 1, 1] [2022-11-26 00:07:38,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:38,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 00:07:38,845 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:38,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1858769571, now seen corresponding path program 2 times [2022-11-26 00:07:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:38,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046554889] [2022-11-26 00:07:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-26 00:07:39,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:39,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046554889] [2022-11-26 00:07:39,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046554889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:39,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474220595] [2022-11-26 00:07:39,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:07:39,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:39,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:39,076 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:39,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:07:39,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-26 00:07:39,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:07:39,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-26 00:07:39,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-26 00:07:39,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-26 00:07:40,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474220595] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:40,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [471255879] [2022-11-26 00:07:40,106 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 00:07:40,107 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:40,107 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:40,107 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:40,107 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:40,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:07:40,142 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 37 treesize of output 38 [2022-11-26 00:07:40,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:40,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:40,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:40,215 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 211 treesize of output 206 [2022-11-26 00:07:40,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:07:40,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:40,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-11-26 00:07:40,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:40,431 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-26 00:07:40,434 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 132 treesize of output 143 [2022-11-26 00:07:40,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:40,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:40,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:40,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:40,646 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:41,560 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2397#(and (= (select |#valid| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) 1) (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|)) (<= 0 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (<= 1 |~#array~0.base|) (= 3 |~#numbers4~0.base|) (<= |#NULL.offset| 0) (<= |~#numbers2~0.offset| 0) (<= |~#array~0.base| 1) (<= 1 |ULTIMATE.start_getNumbers_#res#1.base|) (<= 1 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= 0 |ULTIMATE.start_getNumbers_#res#1.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|)) |ULTIMATE.start_getNumbers2_#t~mem3#1|) (<= 2 |~#numbers2~0.base|) (= |~#array~0.offset| 0) (not (<= (+ (* |ULTIMATE.start_getNumbers2_~i~1#1| 4) 4 |~#numbers2~0.offset|) (select |#length| |~#numbers2~0.base|))) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |~#numbers2~0.base| 2) (<= 0 |~#numbers2~0.offset|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (= |~#numbers4~0.offset| 0) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:41,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:41,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:41,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-26 00:07:41,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677804137] [2022-11-26 00:07:41,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:41,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:07:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:07:41,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:07:41,562 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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-26 00:07:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:41,748 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-11-26 00:07:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:07:41,748 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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 37 [2022-11-26 00:07:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:41,749 INFO L225 Difference]: With dead ends: 73 [2022-11-26 00:07:41,749 INFO L226 Difference]: Without dead ends: 73 [2022-11-26 00:07:41,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-11-26 00:07:41,750 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 128 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:41,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 31 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-26 00:07:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-26 00:07:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 72 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-26 00:07:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-11-26 00:07:41,753 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 37 [2022-11-26 00:07:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:41,753 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-11-26 00:07:41,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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-26 00:07:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-11-26 00:07:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-26 00:07:41,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:41,754 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2022-11-26 00:07:41,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:41,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-26 00:07:41,955 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1798111424, now seen corresponding path program 2 times [2022-11-26 00:07:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:41,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636848665] [2022-11-26 00:07:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:42,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:42,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636848665] [2022-11-26 00:07:42,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636848665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:42,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:42,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:07:42,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208615354] [2022-11-26 00:07:42,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:42,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:07:42,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:42,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:07:42,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:07:42,157 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-26 00:07:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:42,199 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-11-26 00:07:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:07:42,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 55 [2022-11-26 00:07:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:42,200 INFO L225 Difference]: With dead ends: 72 [2022-11-26 00:07:42,200 INFO L226 Difference]: Without dead ends: 72 [2022-11-26 00:07:42,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-26 00:07:42,202 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:42,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-26 00:07:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-26 00:07:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 71 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-26 00:07:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-11-26 00:07:42,206 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 55 [2022-11-26 00:07:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:42,207 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-11-26 00:07:42,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-26 00:07:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-11-26 00:07:42,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-26 00:07:42,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:42,210 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2022-11-26 00:07:42,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-26 00:07:42,210 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1798111423, now seen corresponding path program 1 times [2022-11-26 00:07:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:42,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475430868] [2022-11-26 00:07:42,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-11-26 00:07:42,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:42,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475430868] [2022-11-26 00:07:42,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475430868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:42,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:42,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:07:42,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509538153] [2022-11-26 00:07:42,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:42,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:07:42,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:42,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:07:42,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:07:42,628 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-26 00:07:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:42,697 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-11-26 00:07:42,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:07:42,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 55 [2022-11-26 00:07:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:42,704 INFO L225 Difference]: With dead ends: 77 [2022-11-26 00:07:42,704 INFO L226 Difference]: Without dead ends: 77 [2022-11-26 00:07:42,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:07:42,705 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:42,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 18 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-26 00:07:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-11-26 00:07:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.21875) internal successors, (78), 73 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-26 00:07:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-11-26 00:07:42,716 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 55 [2022-11-26 00:07:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:42,716 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-26 00:07:42,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-26 00:07:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-11-26 00:07:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-26 00:07:42,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:42,717 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:42,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 00:07:42,718 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:42,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash 93120730, now seen corresponding path program 1 times [2022-11-26 00:07:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:42,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902455918] [2022-11-26 00:07:42,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:42,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:42,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:42,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902455918] [2022-11-26 00:07:42,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902455918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:42,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:42,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:07:42,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475285680] [2022-11-26 00:07:42,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:42,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:07:42,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:42,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:07:42,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:07:42,811 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-26 00:07:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:42,835 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-11-26 00:07:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:07:42,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 56 [2022-11-26 00:07:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:42,836 INFO L225 Difference]: With dead ends: 73 [2022-11-26 00:07:42,837 INFO L226 Difference]: Without dead ends: 73 [2022-11-26 00:07:42,837 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-26 00:07:42,837 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:42,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-26 00:07:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-26 00:07:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.203125) internal successors, (77), 72 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-26 00:07:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-11-26 00:07:42,841 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 56 [2022-11-26 00:07:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:42,841 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-11-26 00:07:42,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-26 00:07:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-11-26 00:07:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-26 00:07:42,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:42,842 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:42,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 00:07:42,843 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash 93120731, now seen corresponding path program 1 times [2022-11-26 00:07:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:42,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588917829] [2022-11-26 00:07:42,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:42,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:42,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588917829] [2022-11-26 00:07:42,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588917829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:07:42,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:07:42,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:07:42,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895749051] [2022-11-26 00:07:42,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:07:42,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:07:42,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:07:42,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:07:42,998 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-26 00:07:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:43,031 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2022-11-26 00:07:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:07:43,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 56 [2022-11-26 00:07:43,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:43,032 INFO L225 Difference]: With dead ends: 74 [2022-11-26 00:07:43,032 INFO L226 Difference]: Without dead ends: 74 [2022-11-26 00:07:43,033 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-26 00:07:43,033 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:43,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:07:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-26 00:07:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-26 00:07:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.2) internal successors, (78), 73 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-26 00:07:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-11-26 00:07:43,036 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 56 [2022-11-26 00:07:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:43,037 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-26 00:07:43,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-26 00:07:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-11-26 00:07:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-26 00:07:43,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:43,038 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:43,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-26 00:07:43,038 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:43,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:43,039 INFO L85 PathProgramCache]: Analyzing trace with hash -705230437, now seen corresponding path program 1 times [2022-11-26 00:07:43,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:43,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613475267] [2022-11-26 00:07:43,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:43,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:43,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:43,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613475267] [2022-11-26 00:07:43,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613475267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:43,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577895228] [2022-11-26 00:07:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:43,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:43,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:43,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:43,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:07:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:43,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-26 00:07:43,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:44,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:44,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 00:07:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:44,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:47,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577895228] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:47,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [93530082] [2022-11-26 00:07:47,077 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-26 00:07:47,077 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:47,078 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:47,078 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:47,078 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:47,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:07:47,122 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 37 treesize of output 38 [2022-11-26 00:07:47,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:47,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:47,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:47,196 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 211 treesize of output 206 [2022-11-26 00:07:47,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:07:47,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:47,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-11-26 00:07:47,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:47,371 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-26 00:07:47,372 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 132 treesize of output 143 [2022-11-26 00:07:47,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:47,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:47,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:47,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:47,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:47,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:07:47,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:47,685 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:07:47,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:47,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:47,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:47,831 INFO L321 Elim1Store]: treesize reduction 30, result has 28.6 percent of original size [2022-11-26 00:07:47,832 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 172 treesize of output 177 [2022-11-26 00:07:47,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:47,942 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:07:47,942 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:47,975 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:49,473 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3517#(and (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.base| 2) (< |ULTIMATE.start_getNumbers3_~i~2#1| 10) (<= 0 |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (<= 0 |ULTIMATE.start_getNumbers2_#res#1.offset|) (= |~#numbers2~0.base| 2) (<= 2 |ULTIMATE.start_getNumbers2_#res#1.base|) (= 3 |~#numbers4~0.base|) (<= 0 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (<= 1 |ULTIMATE.start_getNumbers_#res#1.base|) (<= 1 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers_#res#1.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (not (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|))) (= |~#array~0.offset| 0) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |~#array~0.base| 1) (<= |ULTIMATE.start_getNumbers2_#res#1.base| 2) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |#NULL.offset| 0) (= |~#numbers4~0.offset| 0) (<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 2 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |~#numbers2~0.offset| 0) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:49,473 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:49,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:49,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-26 00:07:49,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833601261] [2022-11-26 00:07:49,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:49,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:07:49,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:49,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:07:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:07:49,476 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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-26 00:07:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:49,858 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2022-11-26 00:07:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:07:49,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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 58 [2022-11-26 00:07:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:49,860 INFO L225 Difference]: With dead ends: 110 [2022-11-26 00:07:49,860 INFO L226 Difference]: Without dead ends: 110 [2022-11-26 00:07:49,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 148 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:07:49,861 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 155 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:49,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 50 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:07:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-26 00:07:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 82. [2022-11-26 00:07:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 81 states have internal predecessors, (90), 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-26 00:07:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-11-26 00:07:49,863 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 58 [2022-11-26 00:07:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:49,863 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-11-26 00:07:49,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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-26 00:07:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-11-26 00:07:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-26 00:07:49,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:49,864 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1] [2022-11-26 00:07:49,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:50,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:50,065 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash -387307071, now seen corresponding path program 1 times [2022-11-26 00:07:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:50,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573393203] [2022-11-26 00:07:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:50,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:50,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:50,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573393203] [2022-11-26 00:07:50,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573393203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:50,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328089922] [2022-11-26 00:07:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:50,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:50,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:50,273 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:50,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 00:07:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:50,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-26 00:07:50,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:50,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:50,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:50,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328089922] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:50,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [949035708] [2022-11-26 00:07:50,581 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-26 00:07:50,581 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:50,582 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:50,582 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:50,582 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:50,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:07:50,616 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 37 treesize of output 38 [2022-11-26 00:07:50,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:50,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:50,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:50,702 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 211 treesize of output 206 [2022-11-26 00:07:50,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:07:50,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:50,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:50,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:50,883 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 142 treesize of output 147 [2022-11-26 00:07:50,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:50,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:50,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:50,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:51,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:51,096 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:07:51,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 38 [2022-11-26 00:07:51,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:51,159 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:07:51,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-26 00:07:51,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:51,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:51,219 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 52 [2022-11-26 00:07:51,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:51,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:51,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:51,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:51,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:51,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:51,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:51,480 INFO L321 Elim1Store]: treesize reduction 135, result has 21.5 percent of original size [2022-11-26 00:07:51,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 314 treesize of output 307 [2022-11-26 00:07:51,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:51,613 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:07:51,614 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:51,652 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:52,975 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4087#(and (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.base| 2) (< |ULTIMATE.start_getNumbers3_~i~2#1| 10) (<= 0 |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|)) |ULTIMATE.start_getNumbers3_#t~mem6#1|) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (<= 0 |ULTIMATE.start_getNumbers2_#res#1.offset|) (= |~#numbers2~0.base| 2) (<= 2 |ULTIMATE.start_getNumbers2_#res#1.base|) (= 3 |~#numbers4~0.base|) (<= 0 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (<= 1 |ULTIMATE.start_getNumbers_#res#1.base|) (<= 1 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers_#res#1.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (= |~#array~0.offset| 0) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |~#array~0.base| 1) (<= |ULTIMATE.start_getNumbers2_#res#1.base| 2) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (not (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|))) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |#NULL.offset| 0) (= |~#numbers4~0.offset| 0) (<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 2 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |~#numbers2~0.offset| 0) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0) (= |#NULL.base| 0) (= (select |#valid| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) 1))' at error location [2022-11-26 00:07:52,975 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:52,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:52,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-11-26 00:07:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923597852] [2022-11-26 00:07:52,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:52,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:07:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:52,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:07:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:07:52,977 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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-26 00:07:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:53,091 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-11-26 00:07:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:07:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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 59 [2022-11-26 00:07:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:53,092 INFO L225 Difference]: With dead ends: 83 [2022-11-26 00:07:53,093 INFO L226 Difference]: Without dead ends: 83 [2022-11-26 00:07:53,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:07:53,093 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:53,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-26 00:07:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-26 00:07:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 82 states have internal predecessors, (89), 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-26 00:07:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-26 00:07:53,096 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 59 [2022-11-26 00:07:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:53,096 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-26 00:07:53,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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-26 00:07:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-26 00:07:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-26 00:07:53,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:53,097 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:07:53,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:53,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:53,304 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1980845717, now seen corresponding path program 1 times [2022-11-26 00:07:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:53,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588710461] [2022-11-26 00:07:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:53,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:53,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588710461] [2022-11-26 00:07:53,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588710461] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:53,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231227207] [2022-11-26 00:07:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:53,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:53,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:53,459 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:53,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 00:07:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:53,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:07:53,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:53,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:07:53,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231227207] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:53,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1326559586] [2022-11-26 00:07:53,693 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-26 00:07:53,694 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:53,694 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:53,694 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:53,695 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:53,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:07:53,734 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 30 treesize of output 31 [2022-11-26 00:07:53,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:53,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:53,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:53,811 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 204 treesize of output 199 [2022-11-26 00:07:53,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:07:53,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:53,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-11-26 00:07:53,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:53,975 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-26 00:07:53,975 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 132 treesize of output 143 [2022-11-26 00:07:54,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:54,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:54,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:54,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:54,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:54,199 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:07:54,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-26 00:07:54,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:54,216 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 30 [2022-11-26 00:07:54,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:54,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:54,297 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 52 [2022-11-26 00:07:54,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:54,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:54,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:54,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:54,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:54,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:54,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:54,557 INFO L321 Elim1Store]: treesize reduction 135, result has 21.5 percent of original size [2022-11-26 00:07:54,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 314 treesize of output 307 [2022-11-26 00:07:54,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:54,673 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:07:54,673 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:54,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:07:54,736 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:07:55,859 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4639#(and (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.base| 2) (<= 10 |ULTIMATE.start_getNumbers3_~i~2#1|) (= (select |#valid| |ULTIMATE.start_getNumbers3_#res#1.base|) 0) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (<= 0 |ULTIMATE.start_getNumbers2_#res#1.offset|) (= |~#numbers2~0.base| 2) (<= 2 |ULTIMATE.start_getNumbers2_#res#1.base|) (= 3 |~#numbers4~0.base|) (<= 0 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (= |ULTIMATE.start_getNumbers3_#res#1.base| |ULTIMATE.start_getNumbers4_~numbers~2#1.base|) (<= 1 |ULTIMATE.start_getNumbers_#res#1.base|) (<= 1 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers4_~i~3#1| 0) (<= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers_#res#1.offset|) (= |ULTIMATE.start_getNumbers3_#res#1.offset| |ULTIMATE.start_getNumbers4_~numbers~2#1.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_#res#1.base|) (= |~#array~0.offset| 0) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |~#array~0.base| 1) (<= |ULTIMATE.start_getNumbers2_#res#1.base| 2) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (= |#NULL.offset| 0) (= |~#numbers4~0.offset| 0) (<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 2 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |~#numbers2~0.offset| 0) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers3_#res#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-26 00:07:55,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:07:55,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:07:55,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-26 00:07:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492650685] [2022-11-26 00:07:55,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:07:55,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:07:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:07:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:07:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:07:55,861 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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-26 00:07:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:07:55,926 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-11-26 00:07:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:07:55,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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 62 [2022-11-26 00:07:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:07:55,927 INFO L225 Difference]: With dead ends: 89 [2022-11-26 00:07:55,928 INFO L226 Difference]: Without dead ends: 89 [2022-11-26 00:07:55,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:07:55,929 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:07:55,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:07:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-26 00:07:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-11-26 00:07:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 86 states have internal predecessors, (93), 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-26 00:07:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-11-26 00:07:55,932 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 62 [2022-11-26 00:07:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:07:55,932 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-11-26 00:07:55,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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-26 00:07:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-11-26 00:07:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-26 00:07:55,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:07:55,933 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 5, 4, 4, 1, 1, 1, 1] [2022-11-26 00:07:55,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-26 00:07:56,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:56,148 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:07:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:07:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1275462337, now seen corresponding path program 2 times [2022-11-26 00:07:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:07:56,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895516087] [2022-11-26 00:07:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:07:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:07:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:07:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-11-26 00:07:56,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:07:56,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895516087] [2022-11-26 00:07:56,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895516087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:07:56,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866081444] [2022-11-26 00:07:56,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:07:56,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:07:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:07:56,637 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:07:56,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 00:07:56,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:07:56,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:07:56,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-26 00:07:56,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:07:57,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:57,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 00:07:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2022-11-26 00:07:57,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:07:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2022-11-26 00:07:58,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866081444] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:07:58,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2098393463] [2022-11-26 00:07:58,488 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-26 00:07:58,488 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:07:58,489 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:07:58,489 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:07:58,489 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:07:58,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:07:58,519 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 30 treesize of output 31 [2022-11-26 00:07:58,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:58,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:58,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:58,584 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 204 treesize of output 199 [2022-11-26 00:07:58,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:07:58,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:58,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:58,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:58,724 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 142 treesize of output 147 [2022-11-26 00:07:58,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:58,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:58,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:58,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:58,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:58,938 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:07:58,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 38 [2022-11-26 00:07:58,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:59,006 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:07:59,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-26 00:07:59,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:59,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:59,069 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 52 [2022-11-26 00:07:59,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:59,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:59,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:59,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:59,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:59,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:07:59,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:59,288 INFO L321 Elim1Store]: treesize reduction 135, result has 21.5 percent of original size [2022-11-26 00:07:59,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 314 treesize of output 307 [2022-11-26 00:07:59,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:07:59,401 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:07:59,401 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:07:59,428 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:08:00,789 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5237#(and (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.base| 2) (< |ULTIMATE.start_getNumbers3_~i~2#1| 10) (<= 0 |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (<= 0 |ULTIMATE.start_getNumbers2_#res#1.offset|) (= |~#numbers2~0.base| 2) (<= 2 |ULTIMATE.start_getNumbers2_#res#1.base|) (= 3 |~#numbers4~0.base|) (<= 0 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (<= 1 |ULTIMATE.start_getNumbers_#res#1.base|) (<= 1 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers_#res#1.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (not (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|))) (= |~#array~0.offset| 0) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |~#array~0.base| 1) (<= |ULTIMATE.start_getNumbers2_#res#1.base| 2) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (= |#NULL.offset| 0) (= |~#numbers4~0.offset| 0) (<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 2 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |~#numbers2~0.offset| 0) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-26 00:08:00,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:08:00,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:08:00,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 15 [2022-11-26 00:08:00,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246147050] [2022-11-26 00:08:00,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:08:00,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:08:00,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:08:00,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:08:00,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:08:00,791 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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-26 00:08:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:08:01,306 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-11-26 00:08:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:08:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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 67 [2022-11-26 00:08:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:08:01,308 INFO L225 Difference]: With dead ends: 87 [2022-11-26 00:08:01,308 INFO L226 Difference]: Without dead ends: 87 [2022-11-26 00:08:01,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-11-26 00:08:01,309 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 107 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:08:01,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 84 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:08:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-26 00:08:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-11-26 00:08:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 85 states have internal predecessors, (91), 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-26 00:08:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-11-26 00:08:01,312 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 67 [2022-11-26 00:08:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:08:01,312 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-11-26 00:08:01,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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-26 00:08:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-11-26 00:08:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-26 00:08:01,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:08:01,313 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1] [2022-11-26 00:08:01,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 00:08:01,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-26 00:08:01,519 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:08:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:08:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash 884626779, now seen corresponding path program 2 times [2022-11-26 00:08:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:08:01,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771674962] [2022-11-26 00:08:01,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:08:01,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:08:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:08:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-11-26 00:08:01,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:08:01,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771674962] [2022-11-26 00:08:01,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771674962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:08:01,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601499946] [2022-11-26 00:08:01,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:08:01,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:08:01,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:08:01,803 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:08:01,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 00:08:01,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-26 00:08:01,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:08:01,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:08:01,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:08:02,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:08:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-11-26 00:08:02,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:08:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-11-26 00:08:02,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601499946] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:08:02,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2134684630] [2022-11-26 00:08:02,462 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-26 00:08:02,462 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:08:02,462 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:08:02,462 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:08:02,462 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:08:02,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:08:02,507 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 37 treesize of output 38 [2022-11-26 00:08:02,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:02,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:02,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:02,563 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 211 treesize of output 206 [2022-11-26 00:08:02,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:08:02,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:02,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-11-26 00:08:02,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:02,732 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-26 00:08:02,732 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 132 treesize of output 143 [2022-11-26 00:08:02,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:02,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:08:02,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:02,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:08:02,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:02,969 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:08:02,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-26 00:08:02,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:02,988 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 30 [2022-11-26 00:08:03,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:03,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:03,038 INFO L350 Elim1Store]: Elim1 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-26 00:08:03,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:08:03,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:03,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:03,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:08:03,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:03,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:03,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:08:03,282 INFO L321 Elim1Store]: treesize reduction 213, result has 21.1 percent of original size [2022-11-26 00:08:03,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 304 treesize of output 303 [2022-11-26 00:08:03,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:08:03,437 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:08:03,437 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:08:03,508 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:08:05,545 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5851#(and (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.base| 2) (< |ULTIMATE.start_getNumbers3_~i~2#1| 10) (<= |~#numbers4~0.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|)) |ULTIMATE.start_getNumbers3_#t~mem6#1|) (<= 3 |~#numbers4~0.base|) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (<= 0 |ULTIMATE.start_getNumbers2_#res#1.offset|) (<= |~#numbers4~0.base| 3) (<= 0 |~#array~0.offset|) (<= 1 |~#array~0.base|) (<= 2 |ULTIMATE.start_getNumbers2_#res#1.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (<= |~#numbers2~0.offset| 0) (<= |~#array~0.base| 1) (<= 1 |ULTIMATE.start_getNumbers_#res#1.base|) (<= 1 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (<= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers_#res#1.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 2 |~#numbers2~0.base|) (<= (+ (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 4) (select |#length| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|)) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (<= |~#numbers2~0.base| 2) (<= |ULTIMATE.start_getNumbers2_#res#1.base| 2) (<= 0 |~#numbers2~0.offset|) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (not (<= (+ |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| (* |ULTIMATE.start_getNumbers3_~i~2#1| 4) 4) (select |#length| |ULTIMATE.start_getNumbers3_~#numbers3~0#1.base|))) (<= 0 |ULTIMATE.start_getNumbers3_~i~2#1|) (<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 2 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= 0 |~#numbers4~0.offset|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= |~#array~0.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers3_~#numbers3~0#1.offset| 0) (= |#NULL.base| 0) (= (select |#valid| |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) 1))' at error location [2022-11-26 00:08:05,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:08:05,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:08:05,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-26 00:08:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679524881] [2022-11-26 00:08:05,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:08:05,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:08:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:08:05,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:08:05,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-11-26 00:08:05,548 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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-26 00:08:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:08:05,674 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-11-26 00:08:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:08:05,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 68 [2022-11-26 00:08:05,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:08:05,675 INFO L225 Difference]: With dead ends: 85 [2022-11-26 00:08:05,675 INFO L226 Difference]: Without dead ends: 85 [2022-11-26 00:08:05,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:08:05,676 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:08:05,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 45 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:08:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-26 00:08:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-26 00:08:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.141025641025641) internal successors, (89), 84 states have internal predecessors, (89), 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-26 00:08:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-26 00:08:05,679 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 68 [2022-11-26 00:08:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:08:05,680 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-26 00:08:05,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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-26 00:08:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-26 00:08:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-26 00:08:05,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:08:05,681 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2022-11-26 00:08:05,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-26 00:08:05,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:08:05,886 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:08:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:08:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2004401643, now seen corresponding path program 2 times [2022-11-26 00:08:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:08:05,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164103396] [2022-11-26 00:08:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:08:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:08:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:08:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:08:06,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:08:06,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164103396] [2022-11-26 00:08:06,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164103396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:08:06,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552387951] [2022-11-26 00:08:06,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:08:06,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:08:06,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:08:06,070 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:08:06,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 00:08:06,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-26 00:08:06,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:08:06,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:08:06,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:08:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:08:06,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:08:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-11-26 00:08:06,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552387951] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:08:06,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1036484389] [2022-11-26 00:08:06,541 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-26 00:08:06,541 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:08:06,542 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:08:06,542 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:08:06,542 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:08:06,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-26 00:08:06,580 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 37 treesize of output 38 [2022-11-26 00:08:06,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:06,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:06,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:06,643 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 211 treesize of output 206 [2022-11-26 00:08:06,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-26 00:08:06,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:06,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:08:06,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:06,798 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 142 treesize of output 147 [2022-11-26 00:08:06,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:06,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:08:06,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:06,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:08:06,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:06,994 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:08:06,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 38 [2022-11-26 00:08:07,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:07,047 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:08:07,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-26 00:08:07,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:07,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:07,097 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 52 [2022-11-26 00:08:07,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:08:07,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:07,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:07,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:08:07,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:07,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:08:07,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:08:07,280 INFO L321 Elim1Store]: treesize reduction 135, result has 21.5 percent of original size [2022-11-26 00:08:07,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 314 treesize of output 307 [2022-11-26 00:08:07,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:08:07,386 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-26 00:08:07,386 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:08:07,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:08:07,440 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:08:08,732 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6487#(and (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.base| 2) (<= 10 |ULTIMATE.start_getNumbers3_~i~2#1|) (= (select |#valid| |ULTIMATE.start_getNumbers3_#res#1.base|) 0) (<= 10 |ULTIMATE.start_getNumbers_~i~0#1|) (<= 0 |ULTIMATE.start_getNumbers2_#res#1.offset|) (= |~#numbers2~0.base| 2) (<= 2 |ULTIMATE.start_getNumbers2_#res#1.base|) (= 3 |~#numbers4~0.base|) (<= 0 |ULTIMATE.start_getNumbers3_~numbers~1#1.offset|) (= |ULTIMATE.start_getNumbers3_#res#1.base| |ULTIMATE.start_getNumbers4_~numbers~2#1.base|) (<= 1 |ULTIMATE.start_getNumbers_#res#1.base|) (<= 1 |ULTIMATE.start_getNumbers2_~numbers~0#1.base|) (= |ULTIMATE.start_getNumbers4_~i~3#1| 0) (<= |ULTIMATE.start_getNumbers2_#res#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers_#res#1.offset|) (= |ULTIMATE.start_getNumbers3_#res#1.offset| |ULTIMATE.start_getNumbers4_~numbers~2#1.offset|) (<= |ULTIMATE.start_getNumbers_#res#1.offset| 0) (<= 0 |ULTIMATE.start_getNumbers3_#res#1.base|) (= |~#array~0.offset| 0) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.offset| 0) (= |~#array~0.base| 1) (<= |ULTIMATE.start_getNumbers2_#res#1.base| 2) (<= |ULTIMATE.start_getNumbers2_~numbers~0#1.base| 1) (<= 0 |ULTIMATE.start_getNumbers2_~numbers~0#1.offset|) (= |#NULL.offset| 0) (= |~#numbers4~0.offset| 0) (<= 10 |ULTIMATE.start_getNumbers2_~i~1#1|) (<= 2 |ULTIMATE.start_getNumbers3_~numbers~1#1.base|) (= |~#numbers2~0.offset| 0) (<= |ULTIMATE.start_getNumbers3_~numbers~1#1.offset| 0) (<= |ULTIMATE.start_getNumbers_#res#1.base| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_getNumbers3_#res#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-26 00:08:08,732 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:08:08,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:08:08,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-11-26 00:08:08,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175467039] [2022-11-26 00:08:08,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:08:08,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:08:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:08:08,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:08:08,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:08:08,734 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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-26 00:08:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:08:08,819 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-11-26 00:08:08,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:08:08,820 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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 74 [2022-11-26 00:08:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:08:08,821 INFO L225 Difference]: With dead ends: 97 [2022-11-26 00:08:08,821 INFO L226 Difference]: Without dead ends: 97 [2022-11-26 00:08:08,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 205 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:08:08,822 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:08:08,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:08:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-26 00:08:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-26 00:08:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 96 states have internal predecessors, (101), 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-26 00:08:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2022-11-26 00:08:08,825 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 74 [2022-11-26 00:08:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:08:08,825 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2022-11-26 00:08:08,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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-26 00:08:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-11-26 00:08:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-26 00:08:08,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:08:08,826 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-26 00:08:08,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-26 00:08:09,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-26 00:08:09,033 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-11-26 00:08:09,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:08:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash -875296149, now seen corresponding path program 3 times [2022-11-26 00:08:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:08:09,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240019677] [2022-11-26 00:08:09,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:08:09,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:08:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:08:09,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:08:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:08:09,439 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:08:09,439 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:08:09,440 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2022-11-26 00:08:09,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2022-11-26 00:08:09,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2022-11-26 00:08:09,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2022-11-26 00:08:09,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2022-11-26 00:08:09,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2022-11-26 00:08:09,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2022-11-26 00:08:09,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2022-11-26 00:08:09,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2022-11-26 00:08:09,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2022-11-26 00:08:09,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2022-11-26 00:08:09,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2022-11-26 00:08:09,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2022-11-26 00:08:09,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2022-11-26 00:08:09,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2022-11-26 00:08:09,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2022-11-26 00:08:09,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2022-11-26 00:08:09,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-26 00:08:09,450 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:08:09,456 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:08:09,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:08:09 BoogieIcfgContainer [2022-11-26 00:08:09,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:08:09,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:08:09,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:08:09,546 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:08:09,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:07:25" (3/4) ... [2022-11-26 00:08:09,548 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-26 00:08:09,609 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:08:09,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:08:09,610 INFO L158 Benchmark]: Toolchain (without parser) took 45397.72ms. Allocated memory was 134.2MB in the beginning and 423.6MB in the end (delta: 289.4MB). Free memory was 91.2MB in the beginning and 237.1MB in the end (delta: -145.9MB). Peak memory consumption was 145.0MB. Max. memory is 16.1GB. [2022-11-26 00:08:09,610 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 134.2MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:08:09,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.05ms. Allocated memory is still 134.2MB. Free memory was 91.2MB in the beginning and 80.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-26 00:08:09,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.40ms. Allocated memory is still 134.2MB. Free memory was 80.7MB in the beginning and 79.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:08:09,611 INFO L158 Benchmark]: Boogie Preprocessor took 27.11ms. Allocated memory is still 134.2MB. Free memory was 79.0MB in the beginning and 77.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:08:09,611 INFO L158 Benchmark]: RCFGBuilder took 668.41ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 77.1MB in the beginning and 137.5MB in the end (delta: -60.5MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-11-26 00:08:09,611 INFO L158 Benchmark]: TraceAbstraction took 44284.31ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 136.5MB in the beginning and 245.4MB in the end (delta: -108.9MB). Peak memory consumption was 150.0MB. Max. memory is 16.1GB. [2022-11-26 00:08:09,612 INFO L158 Benchmark]: Witness Printer took 64.14ms. Allocated memory is still 423.6MB. Free memory was 245.4MB in the beginning and 237.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-26 00:08:09,613 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 134.2MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.05ms. Allocated memory is still 134.2MB. Free memory was 91.2MB in the beginning and 80.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.40ms. Allocated memory is still 134.2MB. Free memory was 80.7MB in the beginning and 79.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.11ms. Allocated memory is still 134.2MB. Free memory was 79.0MB in the beginning and 77.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 668.41ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 77.1MB in the beginning and 137.5MB in the end (delta: -60.5MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 44284.31ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 136.5MB in the beginning and 245.4MB in the end (delta: -108.9MB). Peak memory consumption was 150.0MB. Max. memory is 16.1GB. * Witness Printer took 64.14ms. Allocated memory is still 423.6MB. Free memory was 245.4MB in the beginning and 237.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; [L45] CALL getNumbers4() [L35] CALL, EXPR getNumbers3() [L25] CALL, EXPR getNumbers2() [L16] CALL, EXPR getNumbers() [L8] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}] [L8] COND FALSE !(i < 10) [L12] return array; [L16] RET, EXPR getNumbers() [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=10, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND FALSE !(i < 10) [L21] return numbers2; [L25] RET, EXPR getNumbers2() [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=10, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND FALSE !(i < 10) [L31] return numbers3; [L31] return numbers3; [L35] RET, EXPR getNumbers3() [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={1:0}, i=0, numbers={10:0}, numbers2={2:0}, numbers4={3:0}] [L37] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={10:0}, numbers2={2:0}, numbers4={3:0}] [L38] numbers[i] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 44.1s, OverallIterations: 25, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1007 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1007 mSDsluCounter, 926 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 600 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1824 IncrementalHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 326 mSDtfsCounter, 1824 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1774 GetRequests, 1451 SyntacticMatches, 23 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1695 ImplicationChecksByTransitivity, 17.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=24, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 46 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 1525 NumberOfCodeBlocks, 1330 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1926 ConstructedInterpolants, 104 QuantifiedInterpolants, 17696 SizeOfPredicates, 28 NumberOfNonLiveVariables, 2646 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 49 InterpolantComputations, 12 PerfectInterpolantSequences, 7112/7565 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-26 00:08:09,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cd7b411-1674-4e11-a484-0d22b2454ae8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)